ppxscal/embedding_network huggingface dataset:
The Research of Target Identification Based on Neural Network and D-S Evidence Theory
Authors: Yulan Hu, Xiaojing Fan, Huijing Zhao, Bing Hu
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper presents a method of multi-sensor data fusion based on neuron network and reasoning (Dempster-Shafer evidence reasoning). The method can use D-S’s Evidence to deal with the inaccuracy and fuzzy information. And also it can give full play to self-study of neural net, self-adapting and fault tolerant ability. In this way it has doughty robustness to uncertain information and improve the system identification rate. Then the D-S evidence is used to fuse the results derived from the neural network at different time. The result of computer simulation showsthe method is effective and correct.
Features Selection Using Fuzzy ESVDF for Data Dimensionality Reduction
Authors: Safaa Zaman, Fakhri Karray
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

This paper introduces a novel algorithm for features selection based on a Support Vector Decision Function (SVDF) and Forward Selection (FS) approach with a fuzzy inferencing model. In the new algorithm, Fuzzy Enhancing Support Vector Decision Function (Fuzzy ESVDF), features are selected stepwise, one at a time, by using SVDF to evaluate the weight value of each specified candidate feature, then applying FS with the fuzzy inferencing model to rank the feature according to a set of rules based on a comparison of performance. Using a fast and simple approach, the Fuzzy ESVDF algorithm produces an efficient features set and, thus, provides an effective solution to the dimensionality reduction problem in general. We have examined the feasibility of our approach by conducting several experiments using five different datasets. The experimental results indicate that the proposed algorithm can deliver a satisfactory performance in terms of classification accuracy, False Positive Rate (FPR), training time, and testing time.
Analysis Methods of Workflow Execution Data Based on Data Mining
Authors: Feng Lei, Chen Hexin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Exploring the trivial workflow data needs high performance data processing technology. In this paper we put forward analysis method of workflow execution data based on data mining. The main idea of it is to retrieve the workflow data to a data warehouse and adopt OLAP technology and data mining method to support customers to select different measures and view the corresponding data in different dimensions and different abstract levels, which is important for them to make decision.
Hybrid CMOS-STTRAM non-volatile FPGA: design challenges and optimization approaches
Authors: Somnath Paul, Saibal Mukhopadhyay, Swarup Bhunia
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Research efforts to develop a novel memory technology that combines the desired traits of non-volatility, high endurance, high speed and low power have resulted in the emergence of Spin Torque Transfer-RAM (STTRAM) as a promising next generation universal memory. However, the prospect of developing a non-volatile FPGA framework with STTRAM exploiting its high integration density remains largely unexplored. In this paper, we propose a novel CMOS-STTRAM hybrid FPGA framework; identify the key design challenges; and propose optimization techniques at circuit, architecture and application mapping levels. Simulation results show that a STTRAM based optimized FPGA framework achieves an average improvement of 48.38% in area, 22.28% in delay and 16.1% in dynamic power for ISCAS benchmark circuits over a conventional CMOS based FPGA design.
Two Types of Sound Tool for Editing Speech Signal: Sound Cutter and Symbolic Sound Editor
Authors: Tomoko Sagisaka, Tsutomu Munakata
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In recent years multimedia have been frequently used in almost every part of educational settings. In particular the use of sound has produced much effectiveness in a variety of educational activities. In this demonstration, we show two novel types of sound tool for editing speech signal called by "Sound Cutter" and "Symbolic Sound Editor". These sound tools not only facilitate producing hypermedia teaching/studying materials, but also assist language education effectively. Sound Cutter decomposes automatically a continuous speech signal into several short segments based on the pause positions, and assigns serial ID into them to register with a database. This process allows user to reconstruct the segmented sound easily and reproduce a new file as they like. Next Symbolic Sound Editor splits automatically a speech signal into much smaller segments and put index numbers into them. User can edit the sounds easily, referring the index numbers instead of sound wave form image.
Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence
Authors: George Stantchev, Derek Juba, William Dorland, Amitabh Varshney
Venue: Computing in Science and Engineering (2009)

Direct numerical simulation (DNS) of turbulence is computationally intensive and typically relies on some form of parallel processing. Spectral kernels used for spatial discretization are a common computational bottleneck on distributed memory architectures. One way to increase DNS algorithms' efficiency is to parallelize spectral kernels using tightly coupled single-program, multiple-data (SPMD) multiprocessor units with minimal interprocessor communication latency. The authors present techniques to map DNS computations to modern graphics processing units (GPUs), which are characterized by very high memory bandwidth and hundreds of SPMD processors. The article compares the performance between the authors' parallel algorithm running on a GPU versus the associated CPU implementation of a solver for one of the fundamental nonlinear models of turbulence theory. They also demonstrate a prototype of a scalable computational steering framework based on turbulence simulation and visualization coupling on the GPU.
Privacy-preserving browser-side scripting with BFlow
Authors: Alexander Yip, Neha Narula, Maxwell Krohn, Robert Morris
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Some web sites provide interactive extensions using browser scripts, often without inspecting the scripts to verify that they are benign and bug-free. Others handle users' confidential data and display it via the browser. Such new features contribute to the power of online services, but their combination would allow attackers to steal confidential data. This paper presents BFlow, a security system that uses information flow control to allow the combination while preventing attacks on data confidentiality. BFlow allows untrusted JavaScript to compute with, render, and store confidential data, while preventing leaks of that data. BFlow tracks confidential data as it flows within the browser, between scripts on a page and between scripts and web servers. Using these observations and assistance from participating web servers, BFlow prevents scripts that have seen confidential data from leaking it, all without disrupting the JavaScript communication techniques used in complex web pages. To achieve these ends, BFlow augments browsers with a new "protection zone" abstraction. We have implemented a BFlow browser reference monitor and server support. To evaluate BFlow's confidentiality protection and flexibility, we have built a BFlow-protected blog that supports Blogger's third party JavaScript extensions. BFlow is compatible with every legitimate Blogger extension that we have found, yet it prevents malicious extensions from leaking confidential data.
A Fragile Digital Image Authentication Scheme Inspired by Wet Paper Codes
Authors: Chin-Chen Chang, Yung-Chen Chou
Venue: Fundamenta Informaticae (2009)

Image authentication is an important research topic of maintaining the integrity of digital image contents. Fragile image authentication is the technique for achieving the goal of image content integrity maintenance. This article presents a fragile image authentication scheme based on the concept of wet paper codes. The proposed scheme modifies dry pixels on an image to conceal an image signature. The proposed authentication scheme can exactly detect the tampered area on a tampered image. For saving computation cost of signature embedding, an exclusive-or operation is used in the proposed authentication scheme. The experimental results show that the proposedmethod not only has good visual quality of an authorized image but also successfully detects tampered areas on a tampered image.
Generalised dual arcs and Veronesean surfaces, with applications to cryptography
Authors: A. Klein, J. Schillewaert, L. Storme
Venue: Journal of Combinatorial Theory Series A (2009)

We start by defining generalised dual arcs, the motivation for defining them comes from cryptography, since they can serve as a tool to construct authentication codes and secret sharing schemes. We extend the characterisation of the tangent planes of the Veronesean surface V"2^4 in PG(5,q), q odd, described in [J.W.P. Hirschfeld, J.A. Thas, General Galois Geometries, Oxford Math. Monogr., Clarendon Press/Oxford Univ. Press, New York, 1991], as a set of q^2+q+1 planes in PG(5,q), such that every two intersect in a point and every three are skew. We show that a set of q^2+q planes generating PG(5,q), q odd, and satisfying the above properties can be extended to a set of q^2+q+1 planes still satisfying all conditions. This result is a natural generalisation of the fact that a q-arc in PG(2,q), q odd, can always be extended to a (q+1)-arc. This extension result is then used to study a regular generalised dual arc with parameters (9,5,2,0) in PG(9,q), q odd, where we obtain an algebraic characterisation of such an object as being the image of a cubic Veronesean.
Efficient fusion scheme for multi-focus images by using blurring measure
Authors: Yingjie Zhang, Liling Ge
Venue: Digital Signal Processing (2009)

In this paper, a simple and efficient multi-focus image fusion approach is proposed. As for the multi-focus images, all of them are obtained from the same scene with different focuses. So the images can be segmented into two kinds regions based on out of and on the focus, which directly leads to a region based fusion, i.e., finding out all of the regions on the focus from the source images, and merging them into a combination image. This poses the question of how to locate the regions on the focus from the input images. Considering that the details or scales are different in the regions which are not and on the focuses, blurring measure method in this paper is used to locate the regions based on the blocking degree. This new fusion method can significantly reduce the amount of distortion artifacts and the loss of contrast information. These are usually observed in fused images in the conventional fusion schemes. The fusion performance of proposed method has been evaluated through informal visual inspection and objective fusion performance measurements, and results show the advantages of the approach compared to conventional fusion approaches.
Integrated Multi-layer Network Survivability Based on GMPLS to Improve Fault Recovery Time
Authors: Jijun Zhao, Sujian Wang, Zhiyuan Tang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The paper discussed the coordination control of the multi-layer network survivability scheme of IP/GMPLS over Optical based on the GMPLS. The scheme mainly studies the optimized settings of the fault detection，fault notification，waiting time; and described the detailed survivability coordination scheme of the integrated. And the scheme can reduce the sum of the time that we required to recover the scheme; in addition it can coordinate and control effectively the survival techniques of all layers.
A Global Stability Analysis of a Class of Nolinear Time-Delay Systems Using Continued Fraction Property
Authors: Joon-Young Choi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We consider a class of nonlinear time delay systems with time-varying delays, and achieve a time delay independent sufficient condition for the global asymptotic stability. The sufficient condition is proved by constructing a continued fraction that represents the lower and upper bound variations of the system trajectory along the current of time, and showing that the continued fraction converges to the equilibrium point of the system. The simulation results show the validity of the sufficient condition, and illustrate that the sufficient condition is a close approximation to the unknown necessary and sufficient condition for the global asymptotic stability.
An integrated component design approach to the development of a design information system for customer-oriented product design
Authors: Ming-Chyuan Lin, Lung-An Chen, Ming-Shi Chen
Venue: Advanced Engineering Informatics (2009)

In product design, the designer must draw upon many different types of information including both product-user requirements and design developments in related fields. As each designer has his/her own subjective opinion, an appropriate link between the user requirements and design features must be carefully developed to generate the most suitable design recommendation. The objective of this research is to develop a component design approach for the generation and evaluation of feasible design alternatives to help designers make the most effective design decisions. The development of the approach is based on the concept of component design and interaction links between user requirements and design output parameter values so that the design alternatives can be generated. A confidence interval for order statistics is then used to determine if enough unique feasible design alternatives have been generated. The research is presented in conjunction with a ballpoint pen design to demonstrate the feasibility and advantages of this approach. The results should provide designers with a useful method for the development of a design information system that will efficiently generate and evaluate a set of feasible design alternatives in product design process.
Research of multi- interface data encryption equipment based on mobile terminal
Authors: Zhong Wan, Weifeng Yin, Ronggao Sun
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

Mobile payment security is one of the issues in the mobile terminal itself, this article presents a mobile payment implement solution with distributed key based on the current mobile multi-interface, analysis the mobile payment workflow, gives Multi-interface data encryption device specific hardware design and software design. This solution realizes the high security and low cost of mobile payment, has good applied value and marketable foreground.
Simultaneous data transfer routing and scheduling for interconnect minimization in multicycle communication architecture
Authors: Yu-Ju Hong, Ya-Shih Huang, Juinn-Dar Huang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In deep submicron technology, wire delay is no longer negligible and is gradually becoming a dominant factor of system performance. Several state-of-the-art architectural synthesis flows have already adopted the distributed register architecture to cope with the increasing wire delay by allowing multicycle communication. In this paper, we formulate channel and register allocation within a refined regular distributed register architecture, named RDR-GRS, as a problem of simultaneous data transfer routing and scheduling for minimizing global interconnect resources. We also present an innovative algorithm with both spatial and temporal considerations. It features both a concentration-oriented path router gathering wire-sharable data transfers and a channel-based time scheduler resolving contentions for wires in a channel, which are in spatial and temporal domain, respectively. The experimental results show that the proposed algorithm can significantly outperform existing related works.
Getting insights from the voices of customers: Conversation mining at a contact center
Authors: Hironori Takeuchi, L. Venkata Subramaniam, Tetsuya Nasukawa, Shourya Roy
Venue: Information Sciences: an International Journal (2009)

Business-oriented conversations between customers and agents need to be analyzed to obtain valuable insights that can be used to improve product and service quality, operational efficiency, and revenue. For such an analysis, it is critical to identify appropriate textual segments and expressions to focus on, especially when the textual data consists of complete transcripts, which are often lengthy and redundant. In this paper, we propose a method to identify important segments from the conversations by looking for changes in the accuracy of a categorizer designed to separate different business outcomes. We then use text mining to extract important associations between key entities (insights). We show the effectiveness of the method for making chance discoveries by using real life data from a car rental service center.
On the bipanpositionable bipanconnectedness of hypercubes
Authors: Tzu-Liang Kung, Cheng-Kuan Lin, Tyne Liang, Lih-Hsing Hsu, Jimmy J. M. Tan
Venue: Theoretical Computer Science (2009)

A bipartite graph G is bipanconnected if, for any two distinct vertices x and y of G, it contains an [x,y]-path of length l for each integer l satisfying dG(x,y)&le;/&le;|V(G)|-1 and 2|(l-dG(x,y)), where dG(x,y) denotes the distance between vertices x and y in G and V(G) denotes the vertex set of G. We say a bipartite graph G is bipanpositionably bipanconnected if, for any two distinct vertices x and y of G and for any vertex z&isin;V(G)-{x,y}, it contains a path Pl,k of length l such that x is the beginning vertex of Pl,k, z is the (k+1)-th vertex of Pl,k, and y is the ending vertex of Pl,k for each integer l satisfying dG(x,z)+dG(y,z)&le;/&le;|V(G)|-1 and 2|(l-dG(x,z)-dG(y,z)) and for each integer k satisfying dG(x,z)&le;k&le;l-dG(y,z) and 2|(k-dG(x,z)). In this paper, we prove that an n-cube is bipanpositionably bipanconnected if n&ge;4. As a consequence, many properties of hypercubes, such as bipancyclicity, bipanconnectedness, bipanpositionable Hamiltonicity, etc., follow directly from our result.
Signature Theory in Holographic Algorithms
Authors: Jin-Yi Cai, Pinyan Lu
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Valiant initiated a theory of holographic algorithms based on perfect matchings. These algorithms express computations in terms of signatures realizable by matchgates. We substantially develop the signature theory in terms of d-realizability and d-admissibility, where d measures the dimension of the basis subvariety on which a signature is feasible. Starting with 2-admissibility, we prove a Birkhoff-type theorem for the class of 2-realizable signatures. This gives a complete structural understanding of 2-realizability and 2-admissibility. This is followed by characterization theorems for 1-realizability and 1-admissibility.
A new topological formula and an algorithm for computing ST reliability of wireless networks
Authors: Fei Gao, YinQiu Yang, HaoLiang Hu, JiangGang Yang
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

A new formula for computing ST reliability of wireless networks from Source to Terminal t was presented. The new formula contains terms which correspond one by one to a class Special subnetworks, For a given networks, the terms of the new formula are fewer than those corresponding Satyaranayanna formula. An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of Special networks of given networks. Because the structure of this class of new networks which need to be enumerated was relativity small, the new algorithm's performance was better than Satyaranayanna's algorithm. Finally an example illustrates our conclusion.
Video encoding and transcoding using machine learning
Authors: Gerardo Fernandez Escribano, Rashid Jillani, Christopher Holder, Hari Kalva, Jose Luis Martinez Martinez, Pedro Cuenca
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

Machine learning has been widely used in video analysis and search applications. In this paper, we describe a non-traditional use of machine learning in video processing - video encoding and transcoding. Video encoding and transcoding are computationally intensive processes and this complexity is increasing significantly with new compression standards such as H.264. Video encoders and transcoders have to manage the quality vs. complexity tradeoff carefully. Optimal encoding is prohibitively complex and sub-optimal coding decisions are usually used to reduce complexity but also sacrifices quality. Resource constrained devices cannot use all the advanced coding tools offered by the standards due to computational needs. We show that machine learning can be used to reduce the computational complexity of video coding and transcoding problems without significant loss in quality. We have developed the use of machine learning in video coding and transcoding and have evaluated it on several encoding and transcoding problems. We describe the general ideas in the application of machine learning and present the details of four different problems: 1) MPEG-2 to H.264 video transcoding, 2) H.263 to VP6 transcoding, 3) H.264 encoding and 4) Distributed Video Coding (DVC). Our results show that use of machine learning significantly reduces the complexity of encoders/transcoders and enables efficient video encoding on resource constrained devices such as mobile devices and video sensors.
Design, development, exploitation and assessment of a Cardiology Web PACS
Authors: Carlos Costa, José L. Oliveira, Augusto Silva, Vasco Gama Ribeiro, José Ribeiro
Venue: Computer Methods and Programs in Biomedicine (2009)

Healthcare institutions are increasingly turning to digital medical imaging systems to promote better diagnosis and treatment of their patients. The implementation of the Picture Archiving and Communication System (PACS) clearly contributes to an increase in the productivity of health professionals. However, despite the amount of research that has been done in the past two decades, there are still several technological hurdles that hinder the wide adoption of PACS in the Web environment. In this paper, we present a Web-enabled PACS that through the inclusion of several DICOM services and compression methods promotes medical image availability and greater accessibility to users.