ppxscal/embedding_network huggingface dataset:
Double Mode Fuzzy Control of Gas Drainage System for Coal Local Ventilator
Authors: Xian-Min Ma
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Coal gas drainage out of the mine excavation workspace is the urgent problem to be solved for safe production, a novel double mode fuzzy control strategy of gas drainage system for the coal local ventilator is proposed in the paper. One fuzzy control mode is used in normal aeration state. The other mode is adopted to expel the gas from the mine well, when the gas strength is abnormal. The switching condition of the two modes is discussed, the air flow press distribution in digging laneway is analyzed, and the fuzzy control system is designed. The theory analysis and experiment results show that the suggested double mode fuzzy control schemes are transferred smoothly and the speed of local ventilator is adjusted according to the gas variable concentration in both the normal aeration and abnormal ventilation state, which assures the safety of coal mining. 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
Research and Implementation of Intelligent Chinese Resume Parsing
Authors: ZhiXiang Jiang, Chuang Zhang, Bo Xiao, ZhiQing Lin
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper presents a systematic solution of the information retrieval in online Chinese resume. Chinese resume's contents have several expression and the structure of Chinese resume is complex. So this paper applies rule-based and statistical algorithm to extract information. We get a high accuracy in the experiment on 1500 resumes, which are offered by www.chinahr.com.
Semi-supervised Word Sense Disambiguation Using the Web as Corpus
Authors: Rafael Guzmán-Cabrera, Paolo Rosso, Manuel Montes-Y-Gómez, Luis Villaseñor-Pineda, David Pinto-Avendaño
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

As any other classification task, Word Sense Disambiguation requires a large number of training examples. These examples, which are easily obtained for most of the tasks, are particularly difficult to obtain for this case. Based on this fact, in this paper we investigate the possibility of using a Web-based approach for determining the correct sense of an ambiguous word based only in its surrounding context. In particular, we propose a semi-supervised method that is specially suited to work with just a few training examples. The method considers the automatic extraction of unlabeled examples from the Web and their iterative integration into the training data set. The experimental results, obtained over a subset of ten nouns from the SemEval lexical sample task, are encouraging. They showed that it is possible to improve the baseline accuracy of classifiers such as Naïve Bayes and SVM using some unlabeled examples extracted from the Web.
Input-output identification of nonlinear channels using PSK, QAM and OFDM inputs
Authors: Gerasimos Mileounis, Panos Koukoulas, Nicholas Kalouptsidis
Venue: Signal Processing (2009)

Nonparametric identification of baseband and passband complex Volterra systems excited by communication inputs (phase shift keying, PSK; quadrature amplitude modulation, QAM and OFDM) is considered. Closed form expressions are established using multivariate orthogonal polynomials and higher order statistics. First multivariate orthogonal polynomials are used for baseband and passband Volterra models driven by PSK and QAM inputs and closed form expressions are derived. For baseband Volterra models excited with i.i.d. complex Gaussian signals (OFDM), the general 2p+1 order Volterra system is solved using cross-cumulants in time and frequency domain. An order recursive algorithm is presented for the latter case, that does not require a priori knowledge of the systems order. Performance is illustrated by simulations.
Deep packet anonymization
Authors: Michael Foukarakis, Demetres Antoniades, Michalis Polychronakis
Venue: Proceedings of the Second European Workshop on System Security (2009)

Network traces of Internet attacks are among the most valuable resources for network analysts and security researchers. However, organizations and researchers are usually reluctant to share their network data, as network packets may contain private or sensitive information. To alleviate the problem of information leakage, network traces are often anonymized before being shared. Typical anonymization approaches sanitize, or in some cases completely remove, certain packet header fields, higher-level protocol fields, or even payload information that could reveal the source and destination of an attack incident. Although there exists a variety of network trace anonymization techniques, in this paper we show that in certain cases they are proven inadequate, because attack traces may contain sensitive information not only in the packet headers and the packet payload, which are both exposed "on the wire," but also in the encrypted payload of the self-decrypting shell-code carried in the attack vector of code-injection attacks. To overcome this limitation, we extend an existing network trace anonymization framework to identify and anonymize sensitive information contained in the shellcode of code-injection attack packets. Our approach takes advantage of the certain structure of widely used shellcode decryption schemes to produce fully anonymized attack traces.
High efficient scheduler for distributed data mining applications
Authors: Meiqun Liu, Kun Gao
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Distributed data mining plays a crucial role in knowledge discovery in very large database. The key issue for distributed data mining systems is how to scheduling data mining tasks in a high efficient way. In this paper, we propose a novel and efficient mechanism which is based on decomposing and mapping data mining tasks to DAG, and ordering them according the respective execution cost. The results show that this mechanism is scalable and feasibility.
Music e-students book
Authors: Kristiyan Srebrev, Dimitar Damyanov, Krasimira Damyanova, Tanya Srebreva, Lybomira Hristova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper presents a project for creating a Music student's book for the 6th grade. It is unique in the Bulgarian Educational system and in Music as a subject. It contains all the material required by the national educational regulations - all the themes of the curriculum as well as all Kernels, Standards, Context and Activities of NER about Music for the 6th grade.
Long time missions and the fuel-optimal attitude maneuvering in a swinging mode
Authors: Ilya Ioslovich, Michael Borshchevsky, Per-Olof Gutman
Venue: Mathematical Programming: Series A and B (2009)

The problem of fuel-optimal attitude maneuvering of a space vehicle (SV) with non-fixed time is considered. The state constraint related to the maintenance of artificial gravitation is imposed. This problem is especially important for long-time space missions. The attitude of the space vehicle is controlled by means of a pair of reactive engines which produce a single control torque with fixed direction in the body-fixed frame. An optimal solution is obtained in the class of trajectories belonging to &#x201c;swinging mode&#x201d; two-periodic sliding cycling regimes. The solution is found in analytical form and optimal synthesis is obtained.
Reducing parity generation latency through input value aware circuits
Authors: Yusuf Osmanlioglu, Y. Onur Koçberber, Oguz Ergin
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Soft errors caused by cosmic particles and radiation emitted by the packaging are an important problem in contemporary micropro-cessors. Parity bits are used to detect single bit errors that occur in the storage components. In order to implement parity logic, multiple levels of XOR gates are used and these XOR trees are known to have high delay. Many produced and consumed values inside a processor hold consecutive zeros and ones in their upper order bits. These values can be represented with less number of bits and hence are termed narrow. In this paper we propose a parity generator circuit design that is capable of generating the parity if the input value is narrow. We show that parity can be generated faster than a regular XOR tree implementation using our design for the values that can be represented using fewer bits.
Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata
Authors: Xiaowei Zhang, Yongming Li
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Intuitionistic fuzzy recognizers and intuitionistic fuzzy finite automata are discussed. The notions of intuitionistic fuzzy recognizer, complete accessible intuitionistic fuzzy recognizer, intuitionistic fuzzy finite automata, deterministic intuitionistic fuzzy finite automata, and intuitionistic fuzzy language are introduced. It is shown that the languages recognized by intuitionistic fuzzy recognizer are regular, and the intuitionistic fuzzy languages recognized by the intuitionistic fuzzy finite automaton and the intuitionistic fuzzy languages recognized by deterministic intuitionistic fuzzy finite automaton are equivalent.
A New Method for Solving Transient Lossy Transmission Line Problem
Authors: Turhan Karaguler
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

This paper presents a new technique for the transient analysis of lossy transmission lines. The proposed method is based on discretization of Telegrapher's equation via the auxiliary problem equations to which well known numerical methods can be applied easily. The new method also lets simple and well structured algorithm be developed. A SPICE model is used to verify the results obtained from the new method.
PHAT: a P2P history analysis tool
Authors: John Cannatella, Sean J. Geoghegan
Venue: Journal of Computing Sciences in Colleges (2009)

Peer-to-peer file sharing applications are used by many Internet users to quickly and efficiently copy files around the world. Many different tools provide the user with the ability to search for files based on keywords or file type and download files. Because files can be copied easily and efficiently by the general public, crimes that rely on the transfer of large amounts of data are becoming much more common. For example, music and movie piracy has greatly increased over the last several years. Currently, digital investigators follow a time-consuming manual process to analyze a suspect's hard drive for evidence of crimes committed via file sharing applications. Popular file sharing applications, such as LimeWire, were analyzed to determine the type and location of evidence that can be retrieved from the application's data files. A tool was developed to automatically extract this evidence and present it to the user in a form that is easily understood by digital investigators, attorneys, and jury members.
Secure VPNs for Trusted Computing Environments
Authors: Steffen Schulz, Ahmad-Reza Sadeghi
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

Virtual Private Networks are a popular mechanism for building complex network infrastructures. Such infrastructures are usually accompanied by strict administrative restrictions on all VPN endpoints to protect the perimeter of the VPN. However, enforcement of such restrictions becomes difficult if these endpoints are personal computers used for remote VPN access. Commonly employed measures like anti-virus or software agents fail to defend against unanticipated attacks. The Trusted Computing Group invested significant work into platforms that are capable of secure integrity reporting. However, trusted boot and remote attestation also require a redesign of critical software components to achieve their full potential.In this work, we design and implement a VPN architecture for trusted platforms. We solve the conflict between security and flexibility by implementing a self-contained VPN service that resides in an isolated area, outside the operating system environment visible to the user. We develop a hardened version of the IPsec architecture and protocols by addressing known security issues and reducing the overall complexity of IPsec and IKEv2. The resulting prototype provides access control and secure channels for arbitrary local compartments and is also compatible with typical IPsec configurations. We expect our focus on security and reduced complexity to result in much more stable and thus also more trustworthy software.
Fault tolerant target tracking in sensor networks
Authors: Min Ding, Xiuzhen Cheng
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally-adaptive variant of the approach for dynamic multiple target tracking under changing environments, with the presence of both significant background event noises and a large portion of outlying sensor readings. The target position is estimated by adopting the mean-shift optimization to discriminate the target signals from the background noises. Our mixture model based algorithm is capable of fusing multivariate real-valued sensor measurements and its probability nature shows fault tolerance and robustness in noisy sensing environments. This consideration is practical as in real world applications, sensor readings are multi-modal and may contain errors. The simulation study validates our design and the results indicate that our mixture model based algorithm is an effective and capable approach for the two most typical target signal models under consideration. Desirable quantitative target tracking results are also achieved through extensive evaluations under challenging background conditions.
A certificate program in computer forensics
Authors: Dave Wassenaar, Donna Woo, Penn Wu
Venue: Journal of Computing Sciences in Colleges (2009)

Computer Forensics is a new career that formed in response to high technology crimes. Research was performed to determine the training needed to prepare people for positions in the field of computer forensics. A curriculum was developed, and practitioners in the field were hired to teach the program.
Toward natural interaction through visual recognition of body gestures in real-time
Authors: Javier Varona, Antoni Jaume-i-Capó, Jordi Gonzílez, Francisco J. Perales
Venue: Interacting with Computers (2009)

In most of the existing human-computer interfaces, enactive knowledge as new natural interaction paradigm has not been fully exploited yet. Recent technological advances have created the possibility to enhance naturally and significantly the interface perception by means of visual inputs, the so-called Vision-Based Interfaces (VBI). In the present paper, we explore the recovery of the user's body posture by means of combining robust computer vision techniques and a well known inverse kinematics algorithm in real-time. Specifically, we focus on recognizing the user's motions with a particular mean, that is, a body gesture. Defining an appropriate representation of the user's body posture based on a temporal parameterization, we apply non-parametric techniques to learn and recognize the user's body gestures. This scheme of recognition has been applied to control a computer videogame in real-time to show the viability of the presented approach.
Reversible Watermarking of SVG Graphics
Authors: Dan Wu, Guozhao Wang, Xingliang Gao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Reversible watermarking is suitable for hiding data in 2D vector graphics, especially in Scalable Vector Graphics (SVG) medical images, because it can remove the distortions induced by watermark embedding after extracting the hidden bits. This paper proposes a novel reversible watermarking scheme based on the difference expansion and difference shifting. Since the 'path data' in SVG files includes a sequence of line segments and Bézier segments, we embed the watermark into the vertex coordinates of 'path data' by modifying the differences between the adjacent vertex coordinates. The scheme can keep the Bézier segments C0 continuous by unchanging their start points and end points, and need record neither the location map nor the original least significant bit (LSB) of difference. Our experiment results show that the proposed scheme achieves good performance of the imperceptibility and high-capacity data embedding.
Opinion mining in Hungarian based on textual and graphical clues
Authors: Gábor Berend, Richárd Farkas
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

Opinion Mining aims at recognizing and categorizing or extracting opinions found in unstructured text resources and is one of the most dynamically evolving subdiscipline of Computational Linguistics showing some resemblance to document classification and information extraction tasks. In this paper we propose a novel approach in Opinion Mining which combines Machine Learning models based on traditional textual and graphical clues as well. By examining subjective messages in a given forum topic dealing with a specific voting question, our system makes a prediction about the opinion of unknown people, which can be utilized to predict the forthcoming result of a referendum. The novelty of the work is that beside the regular textual clues (i.e. uni-bigrams), decisions are enhanced by using knowledge derived from a so-called response graph, which represents the interactions between the forum members. Our experimental results showed that with the help of such a graph we were able to achieve better results and significantly outperform the baseline accuracy. The promising results have reinforced our expectations that such an application can be easily adapted to any future Opinion Mining task in the election domain.
Probabilistic EOQ model for deteriorating items under trade credit financing
Authors: L. N. De, A. Goswami
Venue: International Journal of Systems Science (2009)

In this article, a probabilistic inventory model is developed for items that deteriorate at a constant rate and the demand is a random variable. It is also assumed that the supplier will offer a delay period to the retailer for payment and the retailer also extends the trade credit policy to his\her customer. Under these assumptions, we have constructed two separate models: one for discrete cycle time and another for continuous cycle time. To determine the global optimal ordering policies for both the models, we have developed and proved three separate theorems. Some already published results (for probabilistic inventory models) are special cases of our article. Finally, numerical examples are presented to demonstrate the developed models and the solution procedure.
Long, often quite boring, notes of meetings
Authors: Maarten Marx
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

Meeting notes are documents which contain lots of structure. This structure is often implicit in layout and reserved words. On the other hand, since meetings tend to occur regularly and are repeated for long periods of time, this structure is often (semi-)formalized. This makes these documents suitable for automatic semantic annotation efforts. We describe the annotation we performed on the notes of more than 20 years of Dutch parliamentary debates. We annotated every word spoken in parliament with 1) the speaker, 2) her party at the time of speaking, 3) her role/function in parliament and 4) the iso-date. These annotations yield numerous new ways of searching, browsing, mining and summarizing these documents. Meetings are always too long, whence so are their verbatim notes. But of course they contain valuable information and notes have to be consulted from time to time. In this paper we show that semantic annotation can make finding things easier, and more fun.
Black-Box Constructions of Two-Party Protocols from One-Way Functions
Authors: Rafael Pass, Hoeteck Wee
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We exhibit constructions of the following two-party cryptographic protocols given only black-box access to a one-way function: constant-round zero-knowledge arguments (of knowledge) for any language in NP; constant-round trapdoor commitment schemes; constant-round parallel coin-tossing. Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash functions), non-black-box access to a one-way function, or a super-constant number of rounds. As an immediate corollary, we obtain a constant-round black-box construction of secure two-party computation protocols starting from only semi-honest oblivious transfer. In addition, by combining our techniques with recent constructions of concurrent zero-knowledge and non-malleable primitives, we obtain black-box constructions of concurrent zero-knowledge arguments for NP and non-malleable commitments starting from only one-way functions.
A Decentralized Method for Scaling Up Genome Similarity Search Services
Authors: B. B. Zhou C. Wang Albert Y. Zomaya
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

As genome sequence databases grow in size, the accuracy and speed of sequence similarity detection become more important. There is an increasing number of methods being used for detecting sequence similarity. Meanwhile the demands for genome sequence search and alignment services are also increasing. It is a challenge to scale up the computer systems for hosting various methods and serving requests to these methods in a timely manner. Traditional clusters, which are used in most of scientific centers, can not cope with this challenge. This paper tackles this problem in a novel way, which treats the sequence search requests as content requests to both genome databases and similarity detection methods; therefore, scaling up the computer systems that serve these contents is a process of constructing content distribution network. The paper gives a decentralized method to dynamically construct content distribution networks for a variety of genome sequence similarity detection services. It also provides a scheduling algorithm for efficiently using content nodes. Our simulation study shows that scalability and high content node utilization can be achieved in such a system while the cost of achieving remains reasonable.
A model for collaborative artifact inspection and review
Authors: Abdusalam Nwesri, Khairuddin Hashim
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Collaborative inspection on the web aims to eliminate the time factor needed to assemble the inspection or review team at a physical location. Through the collaborative mode, software teams can perform software inspection and review from geographically separated places asynchronously. These newly introduced practices have proven that collaborative inspection and review of artifacts on the web is feasible. This paper provides a model for collaborative inspection and review including possible features of model and tool that will support collaborative inspection and review on the web.