ppxscal/embedding_network huggingface dataset:
The effect of user mobility on the traffic performance of mobile WiMAX for multimedia services over the planned cells
Authors: Jeich Mar, Chin-Chung Ko, Shao-En Chen, Chung-Hao Li
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Based on the planned cells, the traffic performance of the Mobile WiMAX for multimedia services are simulated to observe the relationship among vehicle speed, MIMO antenna mode, operation environment and channel throughput. The effect of user mobility on the handoff rate for new generation and handoff calls is considered in the simulations. The channel throughputs of Mobile WiMAX are observed during the MS speed increases from 50 km/h to 100 km/h.
User's viewpoint on EDP
Authors: Bruce Wrigley, Edward J. Palmer
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Two prime concerns of the user of data processing equipment today are formalism in the administration of the DP function and the question of privacy. The former is becoming important through management pressures for engineering-like controls and procedures. Emphasis is being generated on the latter by activities of governmental bodies in proposing legislation which will control data processing practices. Both pressures will require rapid and definitive response. These concerns are addressed in a series of four panel discussions structured for the EDP user. Panelists discuss the issues and outline their solutions to some of the problems.
Coordinating tasks on the commons: designing for personal goals, expertise and serendipity
Authors: Michel Krieger, Emily Margarete Stark, Scott R. Klemmer
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

How is work created, assigned, and completed on large-scale, crowd-powered systems like Wikipedia? And what design principles might enable these federated online systems to be more effective? This paper reports on a qualitative study of work and task practices on Wikipedia. Despite the availability of tag-based community-wide task assignment mechanisms, informants reported that self-directed goals, within-topic expertise, and fortuitous discovery are more frequently used than community-tagged tasks. We examine how Wikipedia editors organize their actions and the actions of other participants, and what implications this has for understanding, and building tools for, crowd-powered systems, or any web site where the main force of production comes from a crowd of online participants. From these observations and insights, we developed WikiTasks, a tool that integrates with Wikipedia and supports both grassroots creation of site-wide tasks and self-selection of personal tasks, accepted from this larger pool of community tasks.
Minkowski Sum Selection and Finding
Authors: Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Let P,Q &sube; ℝ2 be two n-point multisets and Ar &ge; b be a set of &lambda; inequalities on x and y, where A &epsilon; ℝ &lambda;&times;2, $r=[^x_y]$, and b &epsilon; ℝ&lambda;. Define the constrained Minkowski sum (P &oplus; Q)Ar &ge; b as the multiset {(p + q) | p &epsilon; P,q &epsilon; Q,A(p + q) &ge; b}. Given P, Q, Ar &ge; b, an objective function f:ℝ2&rarr;ℝ, and a positive integer k, the Minkowski Sum Selection problem is to find the k th largest objective value among all objective values of points in (P &oplus; Q)Ar &ge; b. Given P, Q, Ar &ge; b, an objective function f:ℝ2&rarr;ℝ, and a real number &delta;, the Minkowski Sum Finding problem is to find a point (x *,y *) in (P &oplus; Q)Ar &ge; b such that |f(x *,y *) - &delta;| is minimized. For the Minkowski Sum Selection problem with linear objective functions, we obtain the following results: (1) optimal O(nlogn) time algorithms for &lambda;= 1; (2) O(nlog2 n) time deterministic algorithms and expected O(nlogn) time randomized algorithms for any fixed &lambda;> 1. For the Minkowski Sum Finding problem with linear objective functions or objective functions of the form $f(x,y)=\frac{by}{ax}$, we construct optimal O(nlogn) time algorithms for any fixed &lambda; &ge; 1. As a byproduct, we obtain improved algorithms for the Length-Constrained Sum Selection problem and the Density Finding problem.
Multidimensional Semantic Web Services Matching
Authors: Guzmán Llambías, Regina Motz, Alvaro Rettich, Marco Scalone
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

The research activity in the semantic web services area is very active in proposals of solutions for calculating similarity between services. The similarity is measured in different dimensions, i.e. input/output parameters, QoS, correlations between preconditions and effects, etc. This work describes an approach to measuring the degree of similarity between semantic web services considering multiple dimensions as a whole. We propose the integration of results obtained from different matching algorithms in a generic and customizable manner.
Towards a flexible business process modeling and simulation environment
Authors: Changrui Ren, Wei Wang, Jin Dong, Hongwei Ding, Bing Shao, Qinhua Wang
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Business process is crucial to the success of any business. Business process modeling enables a common understanding and analysis of a business process, and simulation is an effective way to diagnose and evaluate complex business processes. There are lots of software tools in market for business process modeling and simulation, however, a common issue for these tools is the conflict between usability and flexibility. The improvement of usability often means the reduction of flexibility. This paper introduces an IBM asset named Supply Chain Process Modeler (SCPM), which aims at providing a tailored business process modeling and simulation environment for business users. SCPM tries to achieve a better trade-off between usability and flexibility with two major efforts, a process repository for process modeling, and a flexible environment for process simulation. A case study from real consulting practice is also included to illustrate how SCPM works for business process simulation.
Modeling merging and breakup in the moving mesh interface tracking method for multiphase flow simulations
Authors: Shaoping Quan, Jing Lou, David P. Schmidt
Venue: Journal of Computational Physics (2009)

The three-dimensional, moving mesh interface tracking (MMIT) method coupled with local mesh adaptations by Quan and Schmidt [S.P. Quan, D.P. Schmidt, A moving mesh interface tracking method for 3D incompressible two-phase flows, J. Comput. Phys. 221 (2007) 761-780] demonstrated the capability to accurately simulate multiphase flows, to handle large deformation, and also to perform interface pinch-off for some specific cases. However, another challenge, i.e. how to handle interface merging (such as droplet coalescence) has not been addressed. In this paper, we present a mesh combination scheme for interface connection and a more general mesh separation algorithm for interface breakup. These two schemes are based on the conversion of liquid cells in one phase to another fluid by changing the fluid properties of the cells in the combination or separation region. After the conversion, the newly created interface is usually ragged, and a local projection method is employed to smooth the interface. Extra mesh adaptation criteria are introduced to handle colliding interfaces with almost zero curvatures as the distance between the interfaces diminishes. Simulations of droplet pair collisions including both head-on and off-center coalescences show that the mesh adaptations are capable of resolving very small length scales, and the mesh combination and mesh separation schemes can handle the topological transitions in multiphase flows. The potential of our method to perform detailed investigations of droplet coalescence and breakup is also displayed.
An Efficient Implementation of SMS4 Cipher with Multiplicative Masking Resistant to Differential Power Analysis Attack
Authors: Yanhua Xu, Xuefei Bai, Li Guo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Since differential power analysis was introduced by Paul Kocher, many countermeasures have been proposed to protect implementations of cryptographic algorithms. Among them, the masking is an efficient method. SMS4 cipher was proved to be vulnerable to first-order DPA attacks, but there has been no countermeasure for it until now. In this paper, we focus on the security of SMS4 implementation, and present a secure implementation of SMS4 cipher with multiplicative masking. Moreover, composite field arithmetic, sharing and reusing hardware resources, and changing calculating orders are employed to produce a small SMS4 circuit. Using SMIC 0.18um CMOS technology, this design requires only about 25 k-gates of area to support both encryption and decryption with 200 Mbps throughput.
Algorithmic Formal Proof of Equivalence of Nondeterministic and Deterministic Finite Automata
Authors: Nazir Ahmad Zafar, Syed Hasnain Haider Shah
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The design of a complex system requires both functional and behavior representation. Formal methods are mathematical based techniques used for specifications of properties hardware and software systems. The Znotation is a formal technique used for capturing functionality. Automata theory is a powerful tool to capture their control behavior. As a result, integration of Z and automata will be an effective tool for modeling of complex systems. The deterministic and nondeterministic finite automata are abstract models of machines used for capturing behavior of systems. Because both of these approaches have different time and space complexitytherefore each one has advantages over the other. Consequently, there must be an automated conversion procedure from nondeterministic to deterministic finite automata and vice versa. In this paper, such a formal conversion is described using Z notation. The specification is analyzed and validated using Z/EVES toolset.
Accomplishments and Challenges in Code Development for Parallel and Multimechanics Simulations
Authors: Tony Degroot, Robert Ferencz, Mark Havstad, Neil Hodge, Jerry Lin, Dennis Parsons, Michael Puso, Jerome Solberg, Edward Zywicz
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The Methods Development Group at Lawrence Livermore National Laboratory has historically developed and supported software for engineering simulations, with a focus on nonlinear structural mechanics and heat transfer. The quality, quantity and complexity of engineering analyses have continued to increase over time as advances in chip speed and multiprocessing computers have empowered this simulation software. As such, the evolution of simulation software has seen a greater focus on multimechanics and the incorporation of more sophisticated algorithms to improve accuracy, robustness and usability. This paper will give an overview of the latest code technologies developed by the Methods Development group in the areas of large deformation transient analysis and implicit coupled codes. Applications were run on the state of the art hardware available at the national laboratories.
Measuring program complexity in a COBOL environment
Authors: Jean Zolnowski, Dick B. Simmons
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Webster defines complexity as the "quality or state of being: hard to separate, analyze, or solve; complicated; intricate; involved; having confusingly interrelated parts." This definition is certainly apropos of software and in fact the term program complexity is found often in discussions centered on software and its evaluation. An understanding of computer program complexity is considered necessary in comprehending how software is written and how a language is used.
On the computation of the rank of block bidiagonal Toeplitz matrices
Authors: Dimitrios Triantafyllou, Marilena Mitrouli
Venue: Journal of Computational and Applied Mathematics (2009)

In the present paper we study the computation of the rank of a block bidiagonal Toeplitz (BBT) sequence of matrices. We propose matrix-based, numerical and symbolical, updating and direct methods, computing the rank of BBT matrices and comparing them with classical procedures. The methods deploy the special form of the BBT sequence, significantly reducing the required flops and leading to fast and efficient algorithms. The numerical implementation of the algorithms computes the numerical rank in contrast with the symbolical implementation, which guarantees the computation of the exact rank of the matrix. The combination of numerical and symbolical operations suggests a new approach in software mathematical computations denoted as hybrid computations.
Current-voltage characteristics of a silicon nanowire transistor
Authors: Mohammad Taghi Ahmadi, Hui Houg Lau, Razali Ismail, Vijay K. Arora
Venue: Microelectronics Journal (2009)

The nanowires and nanotubes are being considered as the best candidates for high-speed applications. It is shown that the high mobility does not always lead to higher carrier velocity. The ultimate drift velocity due to the high-electric-field streaming are based on the asymmetrical distribution function that converts randomness in zero-field to streamlined one in a very high electric field. The limited drift velocity is found to be appropriate thermal velocity for a nondegenerately doped sample of silicon, increasing with the temperature, but independent of carrier concentration. However, the limited drift velocity is the Fermi velocity for a degenerately doped silicon nanowire, increasing with carrier concentration but independent of temperature. The results obtained are applied to the modeling of the current-voltage characteristics of a nanowire transistor.
Spectral Clustering in Social Networks
Authors: Miklós Kurucz, András A. Benczúr, Károly Csalogány, László Lukács
Venue: Advances in Web Mining and Web Usage Analysis: 9th International Workshop on Knowledge Discovery on the Web, WebKDD 2007, and 1st International Workshop on Social Networks Analysis, SNA-KDD 2007, San Jose, CA, USA, August 12-15, 2007. Revised Papers (2009)

We evaluate various heuristics for hierarchical spectral clustering in large telephone call and Web graphs. Spectral clustering without additional heuristics often produces very uneven cluster sizes or low quality clusters that may consist of several disconnected components, a fact that appears to be common for several data sources but, to our knowledge, no general solution provided so far. Divide-and-Merge, a recently described postfiltering procedure may be used to eliminate bad quality branches in a binary tree hierarchy. We propose an alternate solution that enables k-way cuts in each step by immediately filtering unbalanced or low quality clusters before splitting them further.Our experiments are performed on graphs with various weight and normalization built based on call detail records and Web crawls. We measure clustering quality both by modularity as well as by the geographic and topical homogeneity of the clusters. Compared to divide-and-merge, we give more homogeneous clusters with a more desirable distribution of the cluster sizes.
A distance-based fuzzy time series model for exchange rates forecasting
Authors: Yungho Leu, Chien-Pang Lee, Yie-Zu Jou
Venue: Expert Systems with Applications: An International Journal (2009)

Fuzzy time series model has been successfully employed in predicting stock prices and foreign exchange rates. In this paper, we propose a new fuzzy time series model termed as distance-based fuzzy time series (DBFTS) to predict the exchange rate. Unlike the existing fuzzy time series models which require exact match of the fuzzy logic relationships (FLRs), the distance-based fuzzy time series model uses the distance between two FLRs in selecting prediction rules. To predict the exchange rate, a two factors distance-based fuzzy time series model is constructed. The first factor of the model is the exchange rate itself and the second factor comprises many candidate variables affecting the fluctuation of exchange rates. Using the exchange rate data released by the Central Bank of Taiwan, we conducted several experiments on exchange rate forecasting. The experiment results showed that the distance-based fuzzy time series outperformed the random walk model and the artificial neural network model in terms of mean square error.
An algorithm for multi-resolution grid creation applied to explicit finite difference scheme
Authors: Raka Jovanovic, Milan Tuba, Dana Simian
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper deals with the main shortcoming of the finite difference schemes: the use of a discretization grid with the same resolution over the entire problem space. We propose to avoid this problem by using a multiresolution grid. The algorithm for the grid creation is presented, that is correct for numeric calculations and optimized for the use in program application. The algorithm is illustrated with the numerical simulation of the propagation of a light beam in a photonic lattice. It is implemented by an explicit finite difference method. An explicit method is adopted, due to the multidimensionality of the problem and the presence of nonlinearity. The efficiency of the algorithm is increased by further improving the precision of the explicit method by the use of a multidimensional generalization of the Runge-Kutta scheme.
A Solution of Industrial Simulation Codes Sharing in Manufacturing Grid
Authors: Lei Wu, Xiangxu Meng, Shijun Liu, Yuchang Jiao
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Manufacturing grid (MG) is a cooperation platform and resource sharing system among manufacturing enterprises. Virtualization technology is introduced into the resource hierarchy of the Manufacturing Grid. The paper presents a service-oriented solution to share industrial simulation codes in MG. Industrial simulation codes are encapsulated into services following Web Service Resource Framework (WSRF) specification which makes them offer their services and functionality in a standard web service environment. To support and guide the virtualization process, virtualization patterns and tenable conditions are summed up. Concrete web services are virtualized as business services. Engineers can compose these business services in a high level to complete virtual product development. At last, we give a use case to validate our method and put forward the future work.
Document-Word Co-regularization for Semi-supervised Sentiment Analysis
Authors: Vikas Sindhwani, Prem Melville
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The goal of sentiment prediction is to automatically identify whether a given piece of text expresses positive or negative opinion towards a topic of interest. One can pose sentiment prediction as a standard text categorization problem, but gathering labeled data turns out to be a bottleneck. Fortunately, background knowledge is often available in the form of prior information about the sentiment polarity of words in a lexicon. Moreover, in many applications abundant unlabeled data is also available. In this paper, we propose a novel semi-supervised sentiment prediction algorithm that utilizes lexical prior knowledge in conjunction with unlabeled examples. Our method is based on joint sentiment analysis of documents and words based on a bipartite graph representation of the data. We present an empirical study on a diverse collection of sentiment prediction problems which confirms that our semi-supervised lexical models significantly outperform purely supervised and competing semi-supervised techniques.
&ldquo;Backstage solidarity&rdquo; in Spanish- and English-written medical research papers: Publication context and the acknowledgment paratext
Authors: Françoise Salager-Meyer, María Ángeles Alcaraz Ariza, Maryelis Pabón Berbesí
Venue: Journal of the American Society for Information Science and Technology (2009)

The purpose of this article is to analyze the acknowledgment (ACK) paratext of medical research articles written in English and Spanish in three geographical contexts: Venezuela, Spain, and the United States of America. We thus randomly selected 150 research articles from leading medical journals in each country. The frequency and length of ACKs, the number of named and unnamed acknowledgees, the reasons why they were acknowledged, the number of grants received, and the sources of funding were recorded. The motivations that underpinned each ACK were classified according to B. Cronin's (1995) and C.L. Giles & I.G. Councill's (2004) typology. Results were analyzed by means of chi-square tests. Our results show that ACKs from the English-language corpus are significantly more frequent and longer than those from both the Spanish and Venezuelan samples. The number of persons acknowledged and the number of grants received also were significantly greater in the U.S. sample than they were in the two Spanish-language corpora. Differences were found in the number and types of funding sources. Moreover, in the three corpora, technical-instrumental assistance was more frequently acknowledged than was peers' ideational input. A small-scale ethnographic research study was conducted with Spanish and Venezuelan researchers to get firsthand feedback on the motivations that could lie behind their ACK behavior. We conclude that &ldquo;backstage solidarity&rdquo; (E. Goffman, 1959, p. 177; also see B. Cronin & S. Franks, 2006, p. 1915) significantly differs from one context to another, and that the communicative and sociocultural conventions of academic contributorship are not only discipline-dependent but also language- and context-dependent. &copy; 2009 Wiley Periodicals, Inc.
Integrated circuit design with NEM relays
Authors: Fred Chen, Hei Kam, Dejan Markovic, Tsu-Jae King Liu, Vladimir Stojanovic, Elad Alon
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

To overcome the energy-efficiency limitations imposed by finite sub-threshold slope in CMOS transistors, this paper explores the design of integrated circuits based on nanoelectro-mechanical (NEM) relays. A dynamical Verilog-A model of the NEM relay is described and correlated to device measurements. Using this model we explore NEM relay design strategies for digital logic and I/O that can significantly improve the energy efficiency of the whole VLSI system. By exploiting the low effective threshold voltage and zero leakage achievable with these relays, we show that NEM relay-based adders can achieve an order of magnitude or more improvement in energy efficiency over CMOS adders with ns-range delays and with no area penalty. By applying parallelism, this improvement in energy-efficiency can be achieved at higher throughputs as well, at the cost of increased area. Similar improvements in high-speed I/O energy are also predicted by making use of the relays to implement highly energy-efficient digital-to-analog and analog-to-digital converters.