ppxscal/embedding_network huggingface dataset:
The study about penalties for violation of voltage under pool model in power market
Authors: Jiang Chuanwen, Wang Chengmin, Lu Li
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

Two models in Power Pool about the penalties for violating the desired voltage maintained by the generators were put forwarded based on the theory of spot price using optimal power flow. One is for the system that the reactive power services are paid based on real-time pricing of reactive power while the other one is for the system that the reactive power services are paid based on the capital costs. Also, the proposed approaches were tested on an IEEE 30-bus system. The results show that the corresponding penalties quantities can be gotten according to the variation of reactive power demand in power market and the models are effective.
Random projection trees and low dimensional manifolds
Authors: Sanjoy Dasgupta, Yoav Freund
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data without having to explicitly learn this structure.
The perturbed Sparre Andersen model with a threshold dividend strategy
Authors: Heli Gao, Chuancun Yin
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, we consider a Sparre Andersen model perturbed by diffusion with generalized Erlang(n)-distributed inter-claim times and a threshold dividend strategy. Integro-differential equations with certain boundary conditions for the moment-generation function and the mth moment of the present value of all dividends until ruin are derived. We also derive integro-differential equations with boundary conditions for the Gerber-Shiu functions. The special case where the inter-claim times are Erlang(2) distributed and the claim size distribution is exponential is considered in some details.
A High-Performance Bus Architecture for Strongly Coupled Interconnects
Authors: Michael N. Skoufis, Kedar Karmarkar, Themistoklis Haniotakis, Spyros Tragoudas
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Coupling and increasing wire resistance on interconnect fabrics undermine the speed of the transient electrical signals. A brute-force approach for a crosstalk-reduced design relies on increasing the distance of interconnects from each other and using additional repeated logic. A pipelined bus-architecture exploiting the existing electrical noise is proposed. Process variations are taken into consideration in the analysis. The proposed technique is validated for the 65nm and 90nm CMOS processes for interconnects of various lengths.
The Differences of Mechanical Properties of Femur Using Two Material Assignment Methods Based on CT Data
Authors: Yu Shang, Jing Bai, Liang Peng
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The mechanical properties of bone depend on the material assignment in mechanical finite element (FE) analysis. The aim of this study is to investigate the differences of mechanical properties of femur using two material assignment methods. The CT data of bone were used in both methods. The three-dimensional FE model was also established based on the femur CT data and the physiologic loads were applied to the FE model. The analysis results had shown that the mechanical properties of bone were significantly affected by the material assignment method. The mean HU, maximal von Mises stress, and mean strain energy density of the whole femur obtained with the sampling method was 22.0% larger, 42.9% and 72.7% smaller respectively than those obtained with the averaging method. The mean error percentage and correlation coefficient of HU were 36.2% and 0.86 respectively. So, the more accurate material assignment method is needed in further bone mechanical analysis.
A Simulation Study of the WFQ Scheduler in a DiffServ Node under LRD Traffic
Authors: Kleber Kendy Horikawa Nabas, Walter Godoy Júnior, Emilio Carlos Gomes Wille
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The most important desidered characteristic for today’s networks is Quality of Service (QoS). Currently DiffServ-based MPLS networks are able to the development of efficient methods for QoS provisioning. This article analysis, through computer simulation, the performance of WFQ schedulers in a DiffServ node loaded by long range dependence (LRD) traffic. The adopted process for the traffic generation consists in the aggregation of the traffic produced by several TCP connections transmitting files with a size that is modeled by heavy tail distribution. This distribution was obtained, from the Internet, by one-week long measurements. The objective is to observe the bandwidth distribution obtained with the WFQ scheduler, as well as the latency, i.e., the file transfer average delay, in an environment with different priorities. Simulations were carried out with the network simulator NS-2, and several simulation results are presented and analyzed.
Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series
Authors: Boris Ryabko
Venue: Fundamenta Informaticae (2008)

We consider finite-alphabet and real-valued time series and the following four problems: i) estimation of the (limiting) probability P(x_0 ... x_s) for every s and each sequence x_0 ... x_s of letters from the process alphabet (or estimation of the density p(x_0, ..., x_s) for real-valued time series), ii) the so-called on-line prediction, where the conditional probability P(x_{t+1}|...x_1x_2 ... x_t) (or the conditional density P(x_{t+1}|x_1x_2 ... x_t)) should be estimated, where x_1x_2 ... x_t are given, iii) regression and iv) classification (or so-called problems with side information). We show that Kolmogorov complexity (KC) and universal codes (or universal data compressors), whose codeword length can be considered as an estimation of KC, can be used as a basis for constructing asymptotically optimal methods for the above problems. (By definition, a universal code can "compress" any sequence generated by a stationary and ergodic source asymptotically to the Shannon entropy of the source.)
The Interplay Between Two Stock Markets and a Related Foreign Exchange Market: A Simulation Approach
Authors: Erika Corona, Sabrina Ecca, Michele Marchesi, Alessio Setzu
Venue: Computational Economics (2008)

There is still much that is unknown about the interactions among financial markets, and about the relationships between stock prices and exchange rates. This topic gains attention during financial crises, and many papers try to find empirical regularities emerging from financial data, or to study contagion processes. In this paper we present a study on the interplay between two stock markets and one foreign exchange market extending the framework provided by the Genoa Artificial Stock Market. There are four different trading strategies, and the agents are divided into two groups: those who trade in the stock markets and those who trade in the FOREX. We studied three market conditions: the FOREX dynamics, the behavior of the two stock markets together with the FOREX, and finally we conducted a what-if analysis for testing the effects of a inflationary monetary shock of one currency affecting all of the three markets.
Application of adaptive mesh refinement method to complex flows in clean rooms
Authors: Akarapol Meesit, Varangrat Juntasaro
Venue: International Journal of Computational Fluid Dynamics (2007)

The adaptive mesh refinement (AMR) method is developed for three-dimensional turbulent complex flows in clean rooms using the finite volume method with a collocated grid arrangement. Clean rooms have many interesting and complex flow characteristics especially the secondary flows and the recirculation regions. The accurate numerical solution of the flows is important for the efficient design of clean rooms. The use of the conventional uniform grid requires such a high computational time and data storage capacity that they make computational fluid dynamics (CFD) less attractive for the design optimization. The AMR method is, therefore, applied by using the fine grid only in the required regions and using the coarse grid in the other regions. The velocity is chosen as the main parameter for the grid refinement because it is the most influential parameter in clean rooms. The results show that the present AMR method can reduce the computational time by eight times and the data storage requirement is only 37% of that using the conventional method, while the same order of accuracy can be maintained. The present AMR method is, therefore, proved to be a promising technique for solving three-dimensional turbulent complex flows in clean rooms.
Intelligent Security for Inter-space Surveillance Applications
Authors: Geon-Woo Kim, Deok-Gyu Lee, Jong-Wook Han, Sang-Wook Kim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

As ubiquitous computing environment is expanding into our real society and the majority of IT technologies are focusing on ubiquitousness, the procedure for identifying an entity is getting more significan't in the future security system. However, users should be authenticated by every security application since they are heterogeneous and not collaborative each other. So in this paper, we propose a new authentication mechanism for guaranteeing ubiquitousness and usability with intelligent collaborations among authentication applications and surveillance systems for inter-space intelligent security applications.
Cyclability of 3-connected graphs
Authors: Amel Harkat-Benhamdine, Hao Li, Feng Tian
Venue: Journal of Graph Theory (2000)

A subset S of vertices of a graph G is called cyclable in G if there is in G some cycle containing all the vertices of S. We denote by &alpha;(S, G) the number of vertices of a maximum independent set of G[S]. We prove that if G is a 3-connected graph or order n and if S is a subset of vertices such that the degree sum of any four independent vertices of S is at least n&thinsp;+&thinsp;2&alpha;(S, G)&thinsp;-2, then S is cyclable. This result implies several known results on cyclability or Hamiltonicity. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 191&ndash;203, 2000 The work was done while this author was visiting L.R.I. by a cooperation program between CNRS and Academia Sinica and was partially supported by NNSF of China.
New Predictive Models for COD from All Stages in Full ECF Bleaching Sequences
Authors: Sandeep Jain, Gérard Mortha, Christophe Calais
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper proposes new mathematical models for the prediction of chemical oxygen demand (COD) from different stages in full ECF bleaching sequences and discusses several important issues related to model development and interpretation. The effects of different process conditions, like pH, chemical charge, initial Kappa number, carryover, temperature etc., on the formation of COD from the different chlorine dioxide stages (Do, D1, D2) and extraction stages (E, EO, EP, EOP) were studied and corresponding models were developed for softwood and hardwood pulps. The models, based on results obtained from the extensive studies of the kinetics, stoichiometry, and effluent properties of the chlorine dioxide stages and extraction stages in the ECF bleaching of pulp, were tested for accuracy on a vast range of data both from literature and laboratory experiments. The kinetics, stoichiometry and effluent properties have not previously been considered together for optimization and would be of considerable use in bleach plant optimization as well as in process control of different stages. This study will also help in understanding the need for modifications of the conventional conditions in both the chlorine dioxide and the extraction stages to obtain the best mix between a low formation of COD and high bleaching efficiency.
Human-Robot Interface Using System Request Utterance Detection Based on Acoustic Features
Authors: Tetsuya Takiguchi, Tomoyuki Yamagata, Atsushi Sako, Nobuyuki Miyake, Jerome Revaud, Yasuo Ariki
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

For a mobile robot to serve people in actual environments, such as a living room or a party room, it must be easy to control because some users might not even be capable of operating a computer keyboard. For non-expert users, speech recognition is one of the most effective communication tools when it comes to a hands-free (human-robot) interface. This paper describes a new mobile robot with hands-free speech recognition. For a hands-free speech interface, it is important to detect commands for a robot in spontaneous utterances. Our system can understand whether user's utterances are commands for the robot or not, where commands are discriminated from human-human conversations by acoustic features. Then the robot can move according to the user's voice (command). In order to capture the user's voice only, a robust voice detection system with AdaBoost is also described.
Exploring the types and reasons of Internet-triggered academic dishonesty among Turkish undergraduate students: Development of Internet-Triggered Academic Dishonesty Scale (ITADS)
Authors: Yavuz Akbulut, Serkan Şendağ, Gürkay Birinci, Kerem Kılıçer, Mehmet C Şahin, Hatice F Odabaşı
Venue: Computers Education (2008)

Internet contributes to the development of science and facilitates scientific demeanors while it also serves as a ground for academic misdemeanors. Recent studies indicate that Internet facilitates and spreads academic dishonesty. The purpose of the current study is to investigate the extent of involvement of Turkish university students in academic dishonesty practices facilitated through Internet (i.e. e-dishonesty) and to question the conditions which lead to e-dishonesty. Three hundred and forty nine education faculty students from the most populated state university in Turkey were administered two Likert-Scale questionnaires developed by the researchers. After the reliability and validity conditions were met, two exploratory factor analyses were conducted. The first one revealed the factors constituting common types of e-dishonesty among undergraduate students which were fraudulence, plagiarism, falsification, delinquency, and unauthorized help. The second factor analysis exhibited individual and contextual factors triggering e-dishonesty which were named as individual factors, institutional policies and peer pressure. Results of both analyses are discussed and suggestions for further research are provided.
Task-aware search personalization
Authors: Julia Luxenburger, Shady Elbassuoni, Gerhard Weikum
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Search personalization has been pursued in many ways, in order to provide better result rankings and better overall search experience to individual users [5]. However, blindly applying personalization to all user queries, for example, by a background model derived from the user's long-term query-and-click history, is not always appropriate for aiding the user in accomplishing her actual task. User interests change over time, a user sometimes works on very different categories of tasks within a short timespan, and history-based personalization may impede a user's desire of discovering new topics. In this paper we propose a personalization framework that is selective in a twofold sense. First, it selectively employs personalization techniques for queries that are expected to benefit from prior history information, while refraining from undue actions otherwise. Second, we introduce the notion of tasks representing different granularity levels of a user profile, ranging from very specific search goals to broad topics, and base our reasoning selectively on query-relevant user tasks. These considerations are cast into a statistical language model for tasks, queries, and documents, supporting both judicious query expansion and result re-ranking. The effectiveness of our method is demonstrated by an empirical user study.
Peer-to-Peer Streaming Technology Survey
Authors: Jani Peltotalo, Jarmo Harju, Alex Jantunen, Marko Saukko, Lassi Väätämöinen
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Lately there has been a growing interest in the use of peer-to-peer technologies for deploying large-scale live media streaming systems over the Internet. In this paper we give a brief survey on the peer-to-peer streaming field and have also a closer look on selected applications. In practice, we analyse the selected peer-to-peer streaming systems (Octoshape, SopCast, TVAnts and TVU networks) and see if they are suitable for mobile usage. This paper also shows results from an experimental test carried out by using selected applications with a PC over different network connections (EDGE, UMTS, HSDPA, ADSL and LAN). None of the selected applications are designed to be used in a mobile environment, so there is still a lot of work to do to have optimized systems in the mobile network environment.
Issues and challenges of embedded processor education for working professionals
Authors: Nicholas Vun, Wooi-Boon Goh
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

This paper describes how a course in embedded processors and peripherals can be effectively designed for a group of busy working professionals who come from diverse industrial backgrounds. With the increasing emphasis in life-long learning and adult education, we believe the experiences and pedagogical strategies shared here is increasingly relevant to many educators. The rationale behind these proposed strategies for both learning and assessment is described.
A service oriented framework for wireless communication in mobile multi robot systems
Authors: Alexander Tiderko, Thomas Bachran
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Multi robot systems (MRS) have been an active research area for many years. With the robot systems leaving the laboratory environment, the aspect of wireless communication is getting more important. Especially in multi robot systems wireless communication is crucial, but existing middleware for robot systems does not regard the challenges of wireless communication. Among other aspects the fluctuation of link delay, bandwidth and availability is characteristic for wireless communication. A communication system in a multi robot system must be capable to manage these challenges. Another issue is efficient point to multipoint (multicast) communication. This allows the availability of the same data to multiple recipients without an unnecessary high increase of network load compared to unicast communication schemes. We therefore propose a multicast communication framework for a multi robot system based on wireless communication. The framework is organised in two parts. The first part is a general framework for a wireless multicast communication protocol, which is optimized to offer efficient multicast communication capabilities on wireless networks and takes the available link qualities into account. The second part is a framework for a robot middleware, which benefits from the multicast communication optimizations of the first part. The framework assumes unreliable communication, thus taking fluctuating link qualities into account. Both parts are already implemented on a real system and are used in an experimental multi robot system.
Verifying temporal properties of finite-state probabilistic programs
Authors: C. Courcoubetis, M. Yannakakis
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The complexity of testing whether a finite-state (sequential or concurrent) probabilistic program satisfies its specification expressed in linear temporal logic. For sequential programs an exponential-time algorithm is given and it is shown that the problem is in PSPACE; this improves the previous upper bound by two exponentials and matches the known lower bound. For concurrent programs is is shown that the problem is complete in double exponential time, improving the previous upper and lower bounds by one exponential each. These questions are also addressed for specifications described by omega -automata or formulas in extended temporal logic.
Approximate embedding-based subsequence matching of time series
Authors: Vassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic time warping (DTW) distance measure. Our method is called EBSM, shorthand for Embedding-Based Subsequence Matching. The key idea is to convert subsequence matching to vector matching using an embedding. This embedding maps each database time series into a sequence of vectors, so that every step of every time series in the database is mapped to a vector. The embedding is computed by applying full dynamic time warping between reference objects and each database time series. At runtime, given a query object, an embedding of that object is computed in the same manner, by running dynamic time warping between the reference objects and the query. Comparing the embedding of the query with the database vectors is used to efficiently identify relatively few areas of interest in the database sequences. Those areas of interest are then fully explored using the exact DTW-based subsequence matching algorithm. Experiments on a large, public time series data set produce speedups of over one order of magnitude compared to brute-force search, with very small losses (
Performance Evaluation of Space---Time Block Codes Over Keyhole Weibull Fading Channels
Authors: Kostas Peppas, Andreas Maras
Venue: Wireless Personal Communications: An International Journal (2008)

It is well known that degenerate channel phenomena known as keyholes may significantly reduce the capacity of multiple-input and multiple-output (mimo) channels. Keyhole mimo channels were predicted theoretically and also observed experimentally. In this paper, a novel method of analyzing the performance of keyhole mimo channels is proposed. The proposed method is based on the assumption that the received signal at the keyhole encompasses an arbitrary number of multipath components and the propagation environment is such that the resulting signal is observed as a non-linear function of the modulus of the sum of these components. Based on this assumption, we initially introduce the double Weibull fading model, constructed by the product of two independent Weibull distributed fading envelopes. Closed-form expressions for its moments-generating function, probability density function, cumulative distribution function, and moments are also derived. Based on these formulas, we analytically evaluate the performance of a 2 × 2 mimo space---time block-coding (stbc) system, where performance metrics such as the average symbol error probability for several modulation schemes, outage probability, amount of fading and ergodic capacity are given in closed form. Various performance evaluation results are presented in order to verify the proposed analysis.