ppxscal/embedding_network huggingface dataset:
Secure Communications System Through Concurrent AJ and LPD Evaluation
Authors: Chien-Hsing Liao, Mu-King Tsay, Ze-Shin Lee
Venue: Wireless Personal Communications: An International Journal (2009)

In this paper, a systematic approach and their corresponding metrics for concurrent anti-jamming (AJ) and low probability of detection (LPD) performance evaluations of a secure communications system are investigated. In general, it is necessary to deal simultaneously with adversary threats of both active jamming and passive detection for a secure communications system concern. For independent or concurrent AJ and LPD performance evaluations, a single varying paired and multiple paired fixed collocated jammers/interceptors scenario is explored with real sinc type (sin(x)/x) antenna patterns being considered for the communicators. The error probability with both AJ and LPD being considered simultaneously can be derived as system- and geometry-dependent factors and categorized as system metrics related to jammers, interceptors, and communicators themselves only. Whenever multiple collocated jammers/interceptors are considered, we can observe interesting "smoothed" effects for bit energy to jamming density ratio (E b /J o ), when one of these varying jammers/interceptors is approaching or receding. In addition, by means of these system metrics, it is intuitive and straightforward to enhance system performance for the victim or to deteriorate system performance for the adversary, respectively. Moreover, the proposed approach and metrics have also paved one practical way for the developments of the latest emphasized cognitive radio (CR) communications systems, if all the collocated jammers/interceptors on the proposed scenario are replaced with "cooperative" communicators.
Software productivity measurement
Authors: J. S. Collofello, S. N. Woodfield, N. E. Gibbs
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Productivity is a crucial concern for most organizations. This is especially true for software development organizations. Although the term productivity is widely used, the difficulty of defining it leads to serious problems in productivity measurement. This paper will attempt to survey some current productivity measures for software development organizations and discuss their deficiencies. A theoretical productivity model that overcomes these deficiencies will also be presented. A practical productivity measure that exceeds current measures by including a quality component will also be described. Although this measure is only a small improvement over contemporary measures, it is a promising step in the direction of better productivity measurement.
Mobile application for determination of users' text entry speed
Authors: Tsvetozar Georgiev, Evgeniya Georgieva
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The report examines the existing metrics for determination of users' text entry speed. The functional and ergonomic requirements for a mobile application that can perform such task are defined. The realization of a concrete mobile application (m-TESM) is described and appropriate conclusions are made.
Securing frame communication in browsers
Authors: Adam Barth, Collin Jackson, John C. Mitchell
Venue: Communications of the ACM (2009)

Many Web sites embed third-party content in frames, relying on the browser's security policy to protect against malicious content. However, frames provide insufficient isolation in browsers that let framed content navigate other frames. We evaluate existing frame navigation policies and advocate a stricter policy, which we deploy in the open-source browsers. In addition to preventing undesirable interactions, the browser's strict isolation policy also affects communication between cooperating frames. We therefore analyze two techniques for interframe communication between isolated frames. The first method, fragment identifier messaging, initially provides confidentiality without authentication, which we repair using concepts from a well-known network protocol. The second method, <code>postMessage</code>, initially provides authentication, but we discover an attack that breaches confidentiality. We propose improvements in the <code>postMessage</code> API to provide confidentiality; our proposal has been standardized and adopted in browser implementations.
A fuzzy-based method for improving recall values in recommender systems
Authors: Maciej Kiewra, Ngoc Thanh Nguyen
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

In this paper a fuzzy-based recommendation method is presented. Its main goal is to improve the recommendation recall maintaining high recommendation precision. The formal model has been built to describe the method and to analyze how the measures used in traditional Information Retrieval may be adapted to evaluate the effectiveness of recommendation process. The original contributions consist among others of proving several properties which show that the method is able to adapt to changing user's needs and achieving the maximum effectiveness if the component methods work properly.
A Fuzzy Approach to Content-Based Image Retrieval
Authors: Swarup Medasani, Raghu Krishnapuram
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper we present a concise approach to content-based retrieval of segmented images. Our proposed methodology uses Fuzzy Attributed Relational Graphs (FARGs) and an efficient fuzzy graph matching algorithm (FGM). The graph matching algorithm is of the order O(n^2m^2) and hence is suitable for content-based retrieval. Experimental results on random (sub)graph matching and content-based retrieval applications are also provided. The results indicate that the FARG-FGM framework of representing and retrieving images is efficient and accurate.
LAPACK-Based Condition Estimates for the Discrete-Time LQG Design
Authors: P. Hr. Petkov, M. M. Konstantinov, N. D. Christov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The Linear-Quadratic Gaussian (LQG) design is the most efficient and widely used design approach in the field of linear stochastic control systems. From theoretical point of view this approach is reduced to the synthesis of a LQ state regulator and of a Kalman filter for the controlled system. From computational point of view the LQG design consists of solving a pair of matrix Riccati equations: one for the LQ regulator design and a second one (dual to the first Riccati equation) for the Kalman filter design. In this paper we present reliable algorithms for estimation of condition numbers of the discrete Riccati equations in the discrete-time LQG design. Efficient LAPACK-based condition estimators are proposed involving the solution of triangular Lyapunov equations along with one-norm computation.
A Privacy Preserving Repository for Data Integration across Data Sharing Services
Authors: Stephen S. Yau, Yin Yin
Venue: IEEE Transactions on Services Computing (2008)

Current data sharing and integration among various organizations require a central and trusted authority to first collect data from all data sources and then integrate the collected data. This process tends to complicate the update of data and to compromise data sources' privacy. In this paper, a repository for integrating data from various data sharing services without central authorities is presented. The major differences between our repository and existing central authorities are: 1) Our repository collects data from data sharing services based on users' integration requirements rather than all the data from the data sharing services as existing central authorities. 2) While existing central authorities have full control of the collected data, the capability of our repository is restricted to computing the integration results required by users and cannot get other information about the data or use it for other purposes. 3) The data collected by our repository cannot be used to generate other results except that of the specified data integration request, and hence the compromise of our repository can only reveal the results of the specified data integration request, while the compromise of central authorities will reveal all data.
Load balancing model based on Stackelberg game for multi-homing in heterogeneous radio access networks
Authors: Lun Tang, Qianbin Chen, Bao Zhang, Yun Li, Xiaoping Zheng
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We address the problem of load balancing for multi-homing in heterogeneous radio access networks, where multiple wireless access networks compete with each other to offer bandwidth. We firstly have presented a Stackelberg game-theoretic model for dynamic load balancing in heterogeneous radio access networks. We have formulated this situation as an oligopoly market in which the multi-access networks adjust their prices dynamically to gain the maximize profit. A linear incentive mechanism and a non-linear incentive mechanism were proposed to the load balancing problem, by Stackelberg game model we can make the network bandwidth to be rationally and effectively used. Simulation results show our model to enables radio access network to maximize their revenue, and ensure efficient use of bandwidth to achieve load balancing.
A Recursive Padding Technique on Nondeterministic Cellular Automata
Authors: Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t2(n) is a time-constructible function and t2(n) grows faster than t1(n + 1), then there exists a language which can be accepted by a t2(n)-time nondeterministic cellular automaton but not by any t1(n)-time nondeterministic cellular automaton.
Multicast support in multi-chip centralized schedulers in Input Queued switches
Authors: Andrea Bianco, Alessandra Scicchitano
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

IQ switches store packets at input ports to avoid the memory speedup required by OQ switches. However, packet schedulers are needed to determine an I/O (input/output) interconnection pattern that avoids conflicts among packets at output ports. Today, centralized, single-chip, scheduler implementation are largely dominant. In the near future, the multi-chip scheduler implementation will be needed to reduce the hardware scheduler complexity in very large, high-speed, switches. However, the multi-chip implementation implies introducing a non-negligible delay among input and output selectors used to determine the I/O interconnection pattern at each time slot. This delay, mainly due to inter-chip latency, requires modifications to traditional scheduling algorithms, which normally rely on the hypothesis that information exchange among selectors can be performed with negligible delay. We propose a novel multicast scheduler, named IMRR, an extension of a previously proposed multicast scheduling algorithm named mRRM, making it suitable to a multi-chip implementation, and examine its performance by simulation.
Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
Authors: Huifu Xu, Dali Zhang
Venue: Mathematical Programming: Series A and B (2009)

Inspired by a recent work by Alexander et al. (J Bank Finance 30:583&#x2013;605, 2006) which proposes a smoothing method to deal with nonsmoothness in a conditional value-at-risk problem, we consider a smoothing scheme for a general class of nonsmooth stochastic problems. Assuming that a smoothed problem is solved by a sample average approximation method, we investigate the convergence of stationary points of the smoothed sample average approximation problem as sample size increases and show that w.p.1 accumulation points of the stationary points of the approximation problem are weak stationary points of their counterparts of the true problem. Moreover, under some metric regularity conditions, we obtain an error bound on approximate stationary points. The convergence result is applied to a conditional value-at-risk problem and an inventory control problem.
Development of a Movable Service Robot with Double Working Arms for the Elderly and the Disabled
Authors: Zhihua Zhang, Jianyong Zheng, Yang Liu, Gang Lu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper firstly introduces the main design concept of a novel movable service robot prototype for the elderly and the disabled. The robot has the characteristics of simple structure, low cost, double working arms, the vision-based guidance and the wheel motion method. Secondly, the key technology points of the robot are presented and analyzed. Such as double working arms, visual positioning equipment, movable platform, control system and path planning etc. Among them, the double working arms have different configuration structures, and with the double working arm's coordinated control, the robot can realize the special object’s tracking, fetching, stable transferring etc. In addition, the other key technologies of the robot are also presented. Furthermore, all above these studies provided the significant theoretical and experimental foundation for the further study of the concept-accompany robot, which has the humanlike characteristic and the ability to do daily simple housework.
Analysis of an SVD-based adaptive controller using the double pendulum + cart system as a paradigm
Authors: József K. Tar, Imre J. Rudas, Gyula Hermann
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper the behavior of a novel, SVD-based adaptive controller is compared with that of the most sophisticated and popular method introduced by Slotine & Li by the use of a three degree of freedom paradigm, the cart + double pendulum system with dynamic friction. The essential difference between the two approaches is that while the Slotine-Li method tries to identify the parameters of the precise analytical model of the robot on the basis of the assumption that the generalized forces are known, the novel one makes do with the temporal observation of the desired vs. realized response of the system and does not assume the lack of unknown perturbations caused e.g. by internal friction. Its another advantge is that it needs the execution of the SVD only on a rough model of the system only one times, before the commencement of the control cycle within which it works with simple computations. The novel method has the deficiency that in principle it can get out of the region of its convergence so its design and use needs preliminary simulation investigations. However, simulation examples exemplify that its convergence can be guaranteed for practical purposes.
ELQS: An Energy-Efficient and Load-Balanced Queue Scheduling Algorithm for Mobile Ad Hoc Networks
Authors: Jiangtao Yin, Xudong Yang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

This paper presents a novel priority queue scheduling algorithm named energy-efficient and load-balanced queue scheduling algorithm (ELQS) for Mobile Ad Hoc NETwork (MANET) considering both mobile nodes' congestion levels and the nodes' energy usage, which uses mixture of energy balance and traffic balance to solve the problem of "hot spots", some mobile nodes with heavy traffic load using their energy at much higher rate and die much faster than the other nodes, since mobile nodes in MANET usually operate on limited batteries. The capacity cost, a function of one mobile node's congestion level and energy usage, is divided into three different phases by setting Min and Max two thresholds. The packets priority is dynamically assigned according to the current capacity cost of the node. The simulation results show that ELQS can effectively decrease the network transmission delay, promote the network throughput and prolong the network lifetime.
Plenary lecture I: new trends in efficient production and distribution of electrical energy
Authors: Mihai O. Popescu
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

Electrical energy is absolutely necessary for an advanced society. In this context use of classical combustibles (coal, petroleum, nuclear) is limited, e.g. by sources exhaustion. Some other undesired phenomena are commented and the solution - use of renewable energies is discussed. At the European level strategic objectives are presented for each case, even the cost target for 2015. In the same time distribution of electrical energy is subject to modernization with intensive promotion of information technologies. Some new ideas are presented, related with numerical treatment of information in new systems with multiple and distributed sources.
High-Capacity Invisible Background Encoding for Digital Authentication of Hardcopy Documents
Authors: Walter Geisselhardt, Taswar Iqbal
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

A digital authentication technique for hardcopy documents (e.g. contracts, official letters, ID cards etc.) is given. In order to secure the printed contents against forgery attacks the foreground contents are encoded in the superposed constant background greyscale image (CBGI) whereas in contents authentication process the contents are decoded from the scanned superposed background image and compared with scanned or printed contents.The distinguishing features of the novel technique are: l) high-quality superposed constant background image with multiple grey levels, 2) higher data encoding capacity enabling one-to-one contents integrity authentication rather than some selected features, and 3) underlying textual-contents independence, a challenge encountered from the languages with complex writing structures, furthermore, the above characteristics of the superposed data encoding technique allow its application: in the area of secret communication as a tool for military, original quality rather than higher quality fax transmission and digital document management.The superposed background image forming the encoded portion does not affect the aesthetic appearance of the document. The newly developed coding scheme in conjunction with a novel data-reading technique offers data encoding capacity 15 to 20 times higher than that one offered by market products.
S- and R-implications from uninorms continuous in ]0,1[2 and their distributivity over uninorms
Authors: D. Ruiz-Aguilera, J. Torrens
Venue: Fuzzy Sets and Systems (2009)

This work deals with two kinds of implications derived from uninorms continuous in ]0,1[^2: S-implications and R-implications. In both cases, the general expression of such implications is found and several properties are studied. In particular, the distributivity of the S- and R-implications over conjunctive and disjunctive uninorms is investigated.
Bagging for Gaussian process regression
Authors: Tao Chen, Jianghong Ren
Venue: Neurocomputing (2009)

This paper proposes the application of bagging to obtain more robust and accurate predictions using Gaussian process regression models. The training data are re-sampled using the bootstrap method to form several training sets, from which multiple Gaussian process models are developed and combined through weighting to provide predictions. A number of weighting methods for model combination are discussed, including the simple averaging and the weighted averaging rules. We propose to weight the models by the inverse of their predictive variance, and thus the prediction uncertainty of the models is automatically accounted for. The bagging method for Gaussian process regression is successfully applied to the inferential estimation of quality variables in an industrial chemical plant.
Linear minimum variance estimators for systems with bounded random measurement delays and packet dropouts
Authors: Shuli Sun
Venue: Signal Processing (2009)

For discrete-time stochastic linear systems with bounded random measurement delays and packet dropouts, the optimal estimators including filter, predictor and smoother are developed in the linear minimum variance sense based on the innovation analysis approach. Some binary distributed random variables with known distributions are employed to describe the phenomenon of random delays and packet dropouts. Compared with the augmented approach, the computational cost is reduced. Furthermore, the proposed algorithm also gives a suboptimal estimate for systems with unbounded delays and packet dropouts by selecting a sufficient large upper bound. A simulation shows the effectiveness of the proposed algorithms.
Isometric Diamond Subgraphs
Authors: David Eppstein
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We test in polynomial time whether a graph embeds in a distance-preserving way into the hexagonal tiling, the three-dimensional diamond structure, or analogous higher-dimensional structures.
A genetic algorithm approach to an integrated problem of shelf space design and item allocation
Authors: Hark Hwang, Bum Choi, Grimi Lee
Venue: Computers and Industrial Engineering (2009)

Shelf space on which products are displayed is one of the most important resources in retail environment. This paper addresses problems of retailers who sell various brands of items through displaying on shelf space. We develop an integrated mathematical model for the shelf space design and item allocation problem with the objective of maximizing the retailer's profit. To solve the model, genetic algorithms are proposed for two types of shelf space configurations: (1) slicing structure produced by 'guillotine' type cuts and (2) slicing structure by horizontal cuts only. The validity of the model is illustrated with example problems.
Hackers beware: the cautionary story of Gary McKinnon
Authors: Paul Arnell, Alan Reid
Venue: Information and Communications Technology Law (2009)

The law of extradition was changed following the 2001 terrorist attacks in the United States. Subsequent practice has seen the range of extraditable offences expand to include acts not traditionally regarded as terrorist crimes. The case of Gary McKinnon provides one such example. This article describes and analyses the facts and law surrounding the extradition of McKinnon, and concludes that those involved in cyberspace in the United Kingdom should be very conscious of the long arm of United States criminal law.
A newsboy problem with a simple reservation arrangement
Authors: Liang-Hsuan Chen, Ying-Che Chen
Venue: Computers and Industrial Engineering (2009)

Newsboy problems have always been an important issue in inventory management. A number of methods have been proposed to solve such problems based on different objectives or considerations. Different from the existing studies, this paper presents a newsboy model with a simple reservation arrangement by introducing the willingness rate, represented as the function of the discount rate, into the models. Mathematical models are developed, and the solution procedure is derived for determining the optimal discount rate and the optimal order quantity. Through the numerical example, we demonstrated the varied profits yielded from the models considering the reservation arrangement, depending on the number of consumers who accept the reservation policy. The profits derived are greater than those from the classical newsboy model, due to the consideration of the reservation.