ppxscal/embedding_network huggingface dataset:
Requirement analysis for emissions trading management systems using a simulation approach
Authors: Anatoly Kurkovsky
Venue: Proceedings of the IASTED Asian Conference on Modelling and Simulation (2007)

This paper discusses the main elements of greenhouse gases emissions trading process with policies and management models that enable the reduction of negative effects of global warming. We review and discuss targeted greenhouse gases emissions for the main players of the Kyoto protocol (five countries) and the emissions projections of these countries for 2020. We analyze the existing emissions trading programs, mechanisms, policies and models to manage greenhouse gases emissions trading. We propose a simulation approach for a conceptual design of systems for management of the emission trading process at national and international levels.
Online learning and time factor
Authors: Peter Serdyukov, Nataliya Serdyukova
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

Time is a critical factor in learning. Time efficiency of the instruction and of the learning process becomes a decisive factor in assessing a program or a course. Colleges and universities will soon be selected and appreciated not only by the quality of education they provide but also by the time the learning takes. This concerns web-based or online education even more than the traditional, classroom-based education because it is primarily a self-managed enterprise. Research and numerous innovative pedagogic approaches demonstrate that time efficiency of the learning can be improved through the use of accelerated and intensive methodologies, greater involvement of the learner's intellectual and emotional capacities, and effective planning of teaching and learning processes. This paper offers the authors' view on these issues based on their own research.
A graph-based approach for biomedical thesaurus expansion
Authors: Ikumi Suzuki, Kazuo Hara, Masashi Shimbo, Yuji Matsumoto
Venue: Proceeding of the third international workshop on Data and text mining in bioinformatics (2009)

The addition of new terms to biomedical thesauri is important for keeping pace with new research. In the context of a thesaurus expansion task, we investigate the property of Laplacian diffusion kernel matrices that depreciate pivotal vertices having many links to surrounding vertices. We confirm that this property can be seen on the Laplacian matrix of a graph that we construct from the GENIA corpus (a subset of MEDLINE abstracts) and simulate thesaurus expansion by employing either the Laplacian diffusion kernel matrix, or the adjacency matrix (i.e., cosine similarity), to determine the correct position for new biomedical terms being added to the MeSH thesaurus. Whilst results do not show the desired precision, our approach is shown to be complementary to calculation of cosine similarity between thesaurus terms and we recognize directions for future work.
Orthogonal Expansion of Port-scanning Packets
Authors: Hiroaki Kikuchi, Tomohiro Kobori, Masato Terada
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

Observation of port-scan packets performed over the Internet is involved with so many parameters including time,port numbers, source and destination addresses. There are some common port numbers to which many malicious codes likely use to scan,but a relationship between port numbers and the malicious codes are not clearly identified.In this paper, we propose a new attempt to figure characteristics of port-scans observed from distributed many sensors.Our method allows1) analysis of sensors with few significant factors extracted from an orthogonal expansion of port-scan packets,rather than taking care of all possible statistics of port numbers,2) compression of packets data, computed by linear combination of limited number of orthogonal factors,and 3) approximation of number of scanning packets at arbitrarily specified sensor and ports,made from statistical correlation between port numbers. We also evaluate the accuracy of our proposed approximation algorithm based on actually observed packets.
Real-valued maximum likelihood decoder for quasi-orthogonal space-time block codes
Authors: Luay Azzam, Ender Ayanoglu
Venue: IEEE Transactions on Communications (2009)

In this letter, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) based on the real-valued lattice representation and QR decomposition. We show that for a system with rate r = ns/T, where ns is the number of transmitted symbols per T time slots; the proposed algorithm decomposes the original complex-valued system into a parallel system with ns 2 × 2 real-valued components, thus allowing for a simple joint decoding of two real symbols. For a square QAM constellation with L points (L-QAM), this algorithm achieves full diversity by properly incorporating two-dimensional rotation using the optimal rotation angle and the same rotating matrix for any number of transmit antennas (N ≥ 4). We show that the complexity gain becomes greater when N or L becomes larger. The complexity of the proposed algorithm is shown to be linear with the number of transmitted symbols ns.
Cyclic delay diversity with frequency domain turbo equalization for uplink fast fading channels
Authors: Ui-Kun Kwon, Gi-Hong Im
Venue: IEEE Communications Letters (2009)

Cyclic delay diversity (CDD) is an attractive diversity technique due to its low complexity and compatibility to existing wireless communication systems. This letter proposes a CDD with frequency domain turbo equalization (FDTE) for single carrier (SC) transmission, in order to achieve the full spatial diversity of frequency-selective multi-antenna channels. The frequency diversity inherent in SC is picked up from the increased channel selectivity of CDD. The noise or inter-symbol interference enhanced by equalization for highly selective channels is then mitigated through applying FDTE at the receiver. Simulation results show that the performance of proposed system approaches the corresponding orthogonal space-time block coding (STBC) system in slowly fading channels without any data rate loss, and considerably outperforms the STBC system in fast fading channels.
Detection of Insertional Covert Channels Using Chi-square Test
Authors: Cai Zhiyong, Shen Ying, Shen Changxiang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Abstract-Network covert channels can be used to transfer secret information in network protocols. For a kind of network covert channels hidden in overt sources with fixed probability distribution, we propose a modified Pearson chi-square test which improves detection accuracy. We incorporated adjacent probability values and divided the new distribution into two partitions sensitive to different hidden sections. In addition, given an overt source and different covert parameters, we can calculate the relation between covert capacity and detection probability. Advantages of the detection method are verified by an experiment using real network traffic data.
Notes on shift effects for T2-type charts on multivariate ARMA residuals
Authors: Xia Pan
Venue: Computers and Industrial Engineering (2005)

Statistical process control (SPC) needs to be aided by computers in order to deal with dynamic systems. Hence, more knowledge on the complexity of this issue is needed. This paper discusses in general the shift effects of residuals from vector autoregressive moving average process for Shewhart-type, i.e. Hotelling T^2-type charts (we call it H charts). Three types of parameter shift were considered: mean shift, covariance shift, and coefficient shift. The estimation effects were addressed. The discussions begin with the shift effects for residuals then for T^2-type chart on residuals. The out-of-control distributions of the chart statistic were provided in this paper.
Hardware-Software Codesign for High-Speed Signature-based Virus Scanning
Authors: Ying-Dar Lin, Po-Ching Lin, Yuan-Cheng Lai, Tai-Ying Liu
Venue: IEEE Micro (2009)

High-speed network content security applications often offload signature matching to hardware. In such systems, the throughput of the overall system, rather than the hardware engine alone, is significant. The authors offload virus scanning in the ClamAV antivirus package to the BFAST* hardware engine. They find that the data-passing processes significantly degrade system throughput.
Analysis and Mitigation of SSR Based on SVC in Series Compensated System
Authors: Zhi-qiang Zhang, Xiang-ning Xiao
Venue: Proceedings of the 2009 International Conference on Energy and Environment Technology - Volume 02 (2009)

With the development of the power system in China, more and more series capacity compensations have been used in transmission system extensively and the SSR problems caused by series capacitance compensation also come. For mitigating the SSR in transmission system, a mitigation measure based on SVC bas pointed and its control principle has been introduced. The complex torque coefficient approach based on time domain simulation has been used to analysis the influences of the SSR under the condition with SVC or not in this paper. Finally, the deviations between using SVC and without SVC have been analyzed by using time domain simulation, and point that for SSR in power system the SVC is available and effective.
Asymmetrical oscillations in digitally controlled power-factor-correction boost converters
Authors: Jianlong Zou, Xikui Ma, Changqing Du
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Digitally controlled power-factor-correction (PFC) converters are essentially piecewise-smooth nonlinear systems due to their switching action. However, their complex behavior almost remains unexplored. Unlike analog control, digital control introduces a time delay due to the sample-and-hold and the digital computation. Here, a small-signal model that takes the time delay into account is derived to judge the stability of a digitally controlled PFC boost converter. It is proven that the time delay seriously degrades the converter's stability. After the inner current loop and/or the outer voltage loop lose stability, we experimentally discover that oscillations begin to occur, and the oscillations are asymmetrical. Such an asymmetry can be interpreted by the underdevelopment characteristic of the dynamical behavior in the digitally controlled PFC boost converter. The results reported in this brief offer more knowledge about the dynamical behavior in digitally controlled PFC converters.
Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models
Authors: Dong K. Seo, Cerry M. Klein, Wooseung Jang
Venue: Computers and Industrial Engineering (2005)

This paper studies the single machine scheduling problem for the objective of minimizing the expected number of tardy jobs. Jobs have normally distributed processing times and a common deterministic due date. We develop new approaches for this problem that generate near optimal solutions. The original stochastic problem is transformed into a non-linear integer programming model and its relaxations. Computational study validates their effectiveness by comparison with optimal solutions.
Usability, quality, value and e-learning continuance decisions
Authors: Chao-Min Chiu, Meng-Hsiang Hsu, Szu-Yuan Sun, Tung-Ching Lin, Pei-Chen Sun
Venue: Computers Education (2005)

Previous research suggests that an eventual information technology (IT) success depend on both its initial adoption (acceptance) and subsequent continued usage (continuance). Expectancy disconfirmation theory (EDT) has been successfully used to predict users' intention to continue using information technologies. This study proposed a decomposed EDT model to examine cognitive beliefs and affect that influence users' continuance decision in the context of e-learning service. The proposed model extended EDT by decomposing the perceived performance component into usability, quality, and value. Research hypotheses derived from this model are empirically validated using the responses to a survey on e-learning usage among 183 users. The results suggest that users' continuance intention is determined by satisfaction, which in turn is jointly determined by perceived usability, perceived quality, perceived value, and usability disconfirmation.
SAX: a privacy preserving general pupose methodapplied to detection of intrusions
Authors: François Trousset, Pascal Poncelet, Florent Masseglia
Venue: Proceeding of the ACM first international workshop on Privacy and anonymity for very large databases (2009)

To overcome the problem of attacks on networks, new Intrusion Detection System (IDS) approaches have been proposed in recent years. They consist in identifying signatures of known attacks to compare them to each request and determine whether it is an attack or not. However, these methods are set to default when the attack is unknown from the database of signatures. Usually this problem is solved by calling human expertise to update the database of signatures. However, it is frequent that an attack has already been detected by another organization and it would be useful to be able to benefit from this knowledge to enrich the database of signatures. Unfortunately this information is not so easy to obtain. In fact organizations do not necessarily want to spread the information that they have already faced this type of attack. In this paper we propose a new approach to intrusion detection in a collaborative environment but by preserving the privacy of the collaborative organizations. Our approach works for any signature even if it needs a complex program to be detected and insure that no information is disclosed on the content of any of the sites. For this pupose, we have developped a general method (SAX) that allows to compute any algorithm while preserving privacy of data and also of the program code which is computed.
Case Retrieval Method Based on Clustering Algorithm
Authors: Du Hui
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

Case retrieval is a central part in Case-based reasoning (CBR), in order to improve accuracy and efficiency of case retrieval, an improving method based on clustering using of self-organizing maps (SOM) was proposed in this paper. The advantage of this method is Cases’ visual clustering result provided by SOM networks greatly facilitating retrieval process and decreasing the retrieval time.
Effects of Customer Participation Level on Customers' Attributions, Emotions, and Behaviors in Case of Internet Service Failure
Authors: Jong-Kuk Shin, Min-Sook Park, Mi-Ok Oh
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

This study explores the impact of two factors that are prominent in the marketing literature: customer participation and service failure. We here conducted a empirical test to show how customers' perceived level of participation influences their attribution tendency and emotional/behavioral responses toward service failure which they may encounter on internet. According to the results of analysis, customers whose perceived level of participation in service production and delivery is high showed external attribution tendency more, felt disappointment more, and wanted to complain, switch, and communicate negative WOM more than those with low participation perception. The results imply that strategies to blindly raise customer participation should be reconsidered. Internet-based service firms should organize their service procedures easily and simply to reduce customers time and efforts(physical input). They also should design their web sites more interestingly in order to provide pleasant experiences to customers. And they should be careful not to request unnecessary information provision from customers (informational input). In addition, service providers on internet should prepare devices with which customers can complain easily when they experience service failure.
Finger mouse and gesture recognition system as a new human computer interface
Authors: Byong K. Ko, Hyun S. Yang
Venue: Computers and Graphics (1997)

In this paper, we propose a new human computer interface which offers an alternative to traditional mouse and direct manipulation interfaces. This interface enables a user to specify commands and additional parameters by drawing single intuitive gestures with his finger. Most gesture-based interfaces researched so far have needed a mouse or stylus pen as a gesture input device. However, we believe that the idea of making gestures with a human finger appeals more to not only experienced users but also novice users who are usually not accustomed to using computer devices. This paper describes the finger mouse system (FMS) and finger gesture recognition system(FGRS). FMS emulates the functions of a mouse by capturing the image of a hand and analyzing its motion and shape. FGRS provides the user with the capabilities of command input and direct manipulation by recognizing the gesture input by FMS. We utilized Kalman filter-based tracking and syntactic pattern recognition techniques for implementing FMS and FGRS. In addition, we introduce an example drawing program in order to demonstrate the practicality of our approach.
A Novel Watermarking Algorithm in Entropy Coding Based on Image Complexity Analysis
Authors: Man Xuan, Jian-guo Jiang
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02 (2009)

This paper presents a novel blind video watermarking method based on image complexion analysis. The image complexion information is extracted from the DC coefficient in sub blocks transformed by discrete cosine transform (DCT) to make sure the macroblock of image adapt to be embedded watermark information. Subsequently, the algorithm presents DCT coefficients space layered mode (DCSLM), and embeds watermark in the intermediate frequency AC coefficients according to DCSLM and some rules. Watermark detection can be done without the original video. Therefore, it is blind detection. Ultimately, image which has been embedded watermark show the proposed algorithm has favorable imperceptible. Simulation results show the proposed watermarking algorithm has strong robustness against some attacks such as JPEG compression, noise attack, frame statistical average and so on.
Coalition games with cooperative transmission: a cure for the curse of boundary nodes in selfish packet-forwarding wireless networks
Authors: Zhu Han, H. Vincent Poor
Venue: IEEE Transactions on Communications (2009)

In wireless packet-forwarding networks with selfish nodes, application of a repeated game can induce the nodes to forward each others' packets, so that the network performance can be improved. However, the nodes on the boundary of such networks cannot benefit from this strategy, as the other nodes do not depend on them. This problem is sometimes known as the curse of the boundary nodes. To overcome this problem, an approach based on coalition games is proposed, in which the boundary nodes can use cooperative transmission to help the backbone nodes in the middle of the network. In return, the backbone nodes are willing to forward the boundary nodes' packets. Here, the concept of core is used to study the stability of the coalitions in such games. Then three types of fairness are investigated, namely, min-max fairness using nucleolus, average fairness using the Shapley function, and a newly proposed market fairness. Based on the specific problem addressed in this paper, market fairness is a new fairness concept involving fairness between multiple backbone nodes and multiple boundary nodes. Finally, a protocol is designed using both repeated games and coalition games. Simulation results show how boundary nodes and backbone nodes form coalitions according to different fairness criteria. The proposed protocol can improve the network connectivity by about 50%, compared with pure repeated game schemes.
Design of close-to-capacity constrained codes for multi-level optical recording
Authors: Ashwin Kumar, Kees A. Schouhamer Immink
Venue: IEEE Transactions on Communications (2009)

We report a new method for designing (M, d, k) constrained codes for use in multi-level optical recording channels. The method allow us to design practical codes, which have simple encoder tables and decoders having fixed window length. The codes presented here for the d = 1 and d = 2 cases, achieve higher storage densities than previously reported codes, and come within 0.3-0.7% of capacity.
LITS: Lightweight Intelligent Traffic Simulator
Authors: Thomas Winters, Matthew Johnson, Vamsi Paruchuri
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

The traffic lighting systems used to regulate today’s trafficking system, although an integral part of the system, is inefficient.This inefficiency contributes to the increased cost of transportation while also contributing to the levels of pollution emitted as a result of human transportation needs; in addition to these detriments, this inefficiency also wastes the travelers’ time.We strongly believe that Intelligent Traffic Light Control can significantly diminish waiting times before red traffic lights in a city and in the process can save our society billions of Dollars annually. To study the efficiency of current system and performance of any proposed system, there is a strong need for an accurate and lightweight simulator. While several traffic simulators have been developed under the Intelligent Transport System initiative, their primary focus has been on modeling and forecasting vehicle traffic flow and congestion from a queuing perspective. In this describe Lightweight Intelligent Traffic Simulator (LITS) being developed for studying different traffic control systems. 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
Probability of error analysis of BPSK OFDM systems with random residual frequency offset
Authors: P. C. Weeraddana, Nandana Rajatheva, H. Minn
Venue: IEEE Transactions on Communications (2009)

In this paper, we derive closed form bit error rate (BER) expressions for orthogonal frequency division multiplexing (OFDM) systems with residual carrier frequency offset (CFO). Most of the published work treats CFO as a nonrandom parameter. But in our study we consider it as a random parameter. The BER performance of binary phase shift keying (BPSK) OFDM system is analyzed in the cases of additive white Gaussian noise (AWGN), frequency-flat and frequency-selective Rayleigh fading channels. We further discuss how these expressions can be related to systems with practical estimators. The simulation results are provided to verify the accuracy of these error rate expressions.
Analysis and Synthesis of Spatial Parameters Using MDCT
Authors: Shuixian Chen, Ruimin Hu, Jong Hyuk Park, Naixue Xiong, Sang-Soo Yeo
Venue: Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering (2009)

We present a method of analyzing and synthesizing spatial parameters using only Modified Discrete Domain Transform (MDCT). Combing it with Modified Discrete Sine Transform (MDST) enables spatial parameters representation. And instead of direct transforming, MDST spectra can be perfectly built from neighboring MDCT spectra by a conversion matrix, which is highly diagonal and can be approximated by a small number of its sub-diagonals. With MDCT based core coders, like Advanced Audio Coding (AAC), we need no separate transforming for spatial coding, cutting down significant computational complexity.