ppxscal/embedding_network huggingface dataset:
Introduction to Ultra Wideband for Wireless Communications, 1st edition
Authors: Homayoun Nikookar, Ramjee Prasad
Venue:  (2008)

Ultra Wideband (UWB) Technology is the cutting edge technology for wireless communications with a wide range of applications. In Introduction to Ultra Wideband for Wireless Communications UWB principles and technologies for wireless communications are explained clearly. Key issues such as UWB wireless channels, interference, signal processing as well as applications and standardization activities are addressed. Introduction to Ultra Wideband for Wireless Communications provides easy-to-understand material to (graduate) students and researchers working in the field of commercial UWB wireless communications.Problems at the end of each chapter extend the readers understanding of the subject. Introduction to Ultra Wideband for Wireless Communications will also be useful for practicing engineers from industry who deal with the wireless systems that are designed and analyzed with the UWB technique.
Towards High Coherent Requirement Implementation in Evolving Global Cooperative Software Design
Authors: Bin Xu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

In order to quicken the building of large business system, the design of the system and modules are always implemented in an evolving model, but there are many requirement changes in evolving software development, and the consistency of t requirement comprehension should be ensured so as to fulfill the enhanced business request correctly and appropriately. When all the design work is collocated together, the stockholders may have regular face-to-face meetings to transfer business requests, business knowledge and the specification, and to verify whether the design is coherent with the original request. Unfortunately, such regular meetings are costly in global cooperative software design due to the time zone difference, language and culture barrier, and the travel expenditure. Furthermore, the cost for the regular face-to-face meetings turn out to be unaffordable in evolving global cooperative software design because the business requirement transition is more frequent and lasts longer. On the basis of Kruchten's "4+1" view model, the author propose a central layered knowledge management framework to facilitate the requirement comprehension and to reduce the possible requirement conflicts among different business units and different releases. The case study shows a drastic decrease of requirement defects and efforts demands.
A Study of Influence Factors Affecting to Surface Roughness in Stainless Steel Turning
Authors: Sittichai Kaewkuekool, Komson Jirapattarasilp, Kampol Pechkong
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

The purpose of this research was to study factors, which were influenced on surface roughness in stainless steel turning by comparing to surface quality of grinding work set as criterion. Materials used in the experiment were stainless steel (AISI/SUS 304) and inserted carbides surface cutting tools coated with Chemical Vapor Deposition ((CVD) CA 6525) process. Studied factors were consisted of cutting speed, feed rate, and coolants. The results revealed that influenced factor affected to surface roughness was cutting speed, which showed significantly different to surface quality at the level of .05. Lower cutting speed would cause on good surface quality. On the other hand, higher cutting speed would cause on poorer surface quality. Feed rate and coolants were not affected to surface quality. Finally, the analysis of surface roughness using regression equation was identified that cutting speed was the only factor affected to surface roughness.
Model Checking Driven Heuristic Search for Correct Programs
Authors: Gal Katz, Doron Peled
Venue: Model Checking and Artificial Intelligence: 5th International Workshop, MoChArt 2008, Patras, Greece, July 21, 2008. Revised Selected and Invited Papers (2009)

Genetic programming and model checking were combined recently to generate correct-by-construction programs. Unlike other synthesis methods, this approach is based on a search in the state space of syntactically-restricted programs. This search can be seen as a probabilistic and heuristic search. In this paper we discuss the connection between program synthesis and heuristic search.
Attributes of Dynamic Combinatorial Optimisation
Authors: Philipp Rohlfshagen, Xin Yao
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The field of evolutionary computation has traditionally focused on static optimisation problems but recently, many new approaches have been proposed that adapt traditional evolutionary algorithms to deal with the task of tracking high-quality solutions as the search space changes over time. Algorithms developed specifically for dynamic domains have been tested on a wide range of different problems, including well-specified benchmark generators. However, the lack of theoretical results, a general omission of references to actual real-world scenarios, as well as a substantial emphasis on the continuous domain may divert attention away from some highly relevant issues. Here we review the state of the field and analyse dynamics in the combinatorial domain, using the subset sum problem as an example. It is shown that some of the assumptions underlying the development of new algorithms do not necessarily hold in the case of discrete optimisation. Furthermore, it is argued that more attention should be paid to the underlying dynamics and the impact of the representation used.
Highly parallel associative search and its application to cellular database machine design
Authors: Sakti Pramanik
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper describes a fast associative search algorithm based on parallel searching by pattern-splitting. The text is read as a sequence of substrings and searching is parallel within each substring. Substring length can be arbitrarily chosen and this division is independent of the logical partitioning of the data, such as tuple and domain. This provides a flexible storage structure across tracks of the secondary storage. The algorithm developed is used in the design of a hardware associative search. It works directly on the secondary storage and is a basis for database machine design. The design is cellular in structure and can be implemented by using LSI technology.
A GPS-Free Wireless Mesh Network Localization Approach
Authors: Jingxuan Wang, Mingjun Tian, Tong Zhao, Wei Yan
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Wireless Mesh Networks (WMN) is a new type of wireless access network that combines the advantages of Wireless Local Area Networks (WLAN) with those of Mobile Ad hoc networks (MANET). The localization of mobile nodes in WMN has not been paid much attention as of yet in comparison with that of WLAN and MANET. As an essential component of user mobility support, localization in WMN should be more accurate in order to meet the need of mobile users in WMN. In this paper, we propose a Ring Overlapping based Localization algorithm (ROL) that is based on Subtle Partial Range Aware (SPRA) distance measurement method. The experiments show that our new algorithms receive better results than existing methods and can reduce localization error within 3 meters in buildings.
An index management using CHC-cluster for flash memory databases
Authors: Siwoo Byun, Moonhaeng Hur
Venue: Journal of Systems and Software (2009)

Flash memories are one of the best media to support portable and desktop computers' storage areas. Their features include non-volatility, low power consumption, and fast access time for read operations, features which are sufficient to present flash memories as major database storage components for portable computers. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of flash memory operations compared to RAM memory. In order to achieve this goal, we propose a new index management scheme based on a compressed hot-cold clustering called CHC-Tree. The CHC-Tree-based index management scheme improves index operation performance by compressing the flash index nodes and clustering the hot-cold segments. The cold cluster compression techniques using unused free area in index node reduces the number of slow write operations in index node insert/delete processes. Our performance evaluation shows that our scheme significantly reduces the write operation overheads, improving the index update performance of B-Tree by 21.9%.
Multilevel Splitting of Weighted Graph-Laplacian Arising in Non-conforming Mixed FEM Elliptic Problems
Authors: P. T. Boyanova, S. D. Margenov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We consider a second-order elliptic problem in mixed form that has to be solved as a part of a projection algorithm for unsteady Navier-Stokes equations. The use of Crouzeix-Raviart non-conforming elements for the velocities and piece-wise constants for the pressure provides a locally mass-conservative algorithm. Then, the Crouzeix-Raviart mass matrix is diagonal, and the velocity unknowns can be eliminated exactly. The reduced matrix for the pressure is referred to as weighted graph-Laplacian. In this paper we study the construction of optimal order preconditioners based on algebraic multilevel iterations (AMLI). The weighted graph-Laplacian for the model 2-D problem is considered. We assume that the finest triangulation is obtained after recursive uniform refinement of a given coarse mesh. The introduced hierarchical splitting is the first important contribution of this article. The proposed construction allows for a local analysis of the constant in the strengthened Cauchy-Bunyakowski-Schwarz (CBS) inequality. This is an important characteristic of the splitting and is associated with the angle between the two hierarchical FEM subspaces. The estimates of the convergence rate and the computational cost at each iteration show that the related AMLI algorithm with acceleration polynomial of degree two or three is of optimal complexity.
Stability and Bifurcation of the Magnetic Flux Bound States in Stacked Josephson Junctions
Authors: Ivan Christov, Stefka Dimova, Todor Boyadjiev
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The static distributions of the magnetic flux in stacked Josephson junctions are investigated numerically. To solve the nonlinear boundary value problem an iterative algorithm, based on the Continuous analog of Newton method is constructed. The linearized problems at every iteration step are solved by the Galerkin finite element method. In order to study the stability of possible distributions a Sturm-Liouville problem is generated. A minimal eigenvalue equal to zero means a bifurcation of the corresponding solution. The subspace iteration method is used to find the smallest eigenvalues and the corresponding eigenvectors.
A Novel Method for Evaluating Trustworthiness between Strangers in Large, Dynamic Ad Hoc Networks
Authors: Yanhui Ding, Qingzhong Li, Feifei Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The performance of ad hoc networks depends on cooperation and trust among distributed nodes. To enhance security in ad hoc networks, it is important to evaluate trustworthiness of other nodes without centralized authorities. In this work, we are focusing on the evaluation of trustworthiness between two strangers in large, dynamic ad hoc networks. This novel evaluation process is modeled as a common problem on two Trust Graphs, where nodes represent entities, and edges represent trust relations. According to the character of Quasi-Clique, we show how two strangers can efficiently establish an indirect trust relationship in large, dynamic ad hoc networks without a centralized trust authority.
Formal Models for Expert Finding on DBLP Bibliography Data
Authors: Hongbo Deng, Irwin King, Michael R. Lyu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Finding relevant experts in a specific field is often crucial for consulting, both in industry and in academia. The aim of this paper is to address the expert-finding task in a real world academic field. We present three models for expert finding based on the large-scale DBLP bibliography and Google Scholar for data supplementation. The first, a novel weighted language model, models an expert candidate based on the relevance and importance of associated documents by introducing a document prior probability, and achieves much better results than the basic language model. The second, a topic-based model, represents each candidate as a weighted sum of multiple topics, whilst the third, a hybrid model, combines the language model and the topic-based model. We evaluate our system using a benchmark dataset based on human relevance judgments of how well the expertise of proposed experts matches a query topic. Evaluation results show that our hybrid model outperforms other models in nearly all metrics.
3G/4G Mobile Network Planning Aspects: IMS-capable Core Network Dimensioning and Radio Access Network Topological Design for Enabling NGN Services
Authors: Andrey Krendzel
Venue:  (2008)

Network planning of third generation (3G) and fourth generation (4G) mobile systems for enabling NGN services is a very complex process with manydifferent aspects, the result of which influences onthe success of network operators.The first part of the monograph deals with 3GIMS-capable Core Network dimensioning aspects such asmultiservice traffic load estimation, performance evaluation of IMS nodes, etc. The second part of the monograph is focused on 4G Radio Access Network (RAN) topological design aspects to minimize expenses with the RAN deployment taking into account reliability requirements. The methodologies presented in the monograph enable establishing requirements, such as throughput of channels, performance of nodes and routers, both to the equipment of internal IP-networks in the 3G/4Gmobile systems and to the gateways providing the interaction between the 3G/4G systems and external networks. Results of the research allow making easier both the preparation of business-plans for development of wide range of NGN services and the preparation of system projects for deployment of 3G/4G mobile network equipment.
Taking shortcuts: embedded physical interfaces for spatial navigation
Authors: Douglas Boari, Mike Fraser
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Designing for embodied physical interaction is just as important at a coarse level of spatial navigation as in the minutiae of object exploration. We created interactive embedded interfaces called 'Navitiles' that can be suspended in a floor to support navigation of a building. Our design uses capacitance and RFID sensors to determine users' location and LEDs to indicate possible directions. We determine whether Navitile cues could help users understand spatial relationships between points of interest. We based our study on a previous experiment that used a simulated VR maze to test whether users were able to exhibit 'shortcut' behaviour that would indicate the formation of spatial maps. Our hypothesis was that the physicality of embodied spatial navigation directed by the Navitiles in a real maze would enable users to achieve similar spatial shortcut behaviours to those found in the virtual task. We found significant evidence that sufficient spatial knowledge was acquired to enable successful shortcut performance between unexplored routes. However, further work is required to measure the effect of physical body movement on spatial skills development.
A low-power CMOS thyristor based delay element with programmability extensions
Authors: Colin J. Ihrig, Gerold Joseph Dhanabalan, Alex K. Jones
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This paper presents a low-power CMOS thyristor based delay element for inclusion in standard cell ASIC libraries, and a reconfigurable delay element designed for reconfigurable devices. Our design is based on a basic delay element, which serves as a buffer which has been specially designed to have a fixed propagation delay. We present leakage power optimizations, which when applied to the circuit reduces the on-state leakage power consumption by more than 99%, while reducing the off-state leakage power by roughly 96%. We have created delay elements with delay lengths of 4, 5, 7, 9, 11, and 17 ns for inclusion in a standard cell library targeting the IBM 0.13 μm technology. The delay element is then further extended to introduce a programmability feature which allows the delay to be varied. Two reconfigurable delay elements are then added to the delay element standard cell library. The first can be configured for delays of 4, 5, or 7 ns, while the second can be programmed for delays of 9, 11, or 17 ns. Finally, potential uses of the circuits in application specific, as well as reconfigurable systems are explored.
Using Genetic Algorithm for Prediction of Information for Cache Operation in ?Mobile Database
Authors: Hossein Beigi Harchegani, Ahmad Farahi, Hossein Mozdorani Shirazi, Amin Golabpour, Peyman Almasinejad
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

New advantages in wireless network technology, satellite, services and cell connection provide permit ion of usage of mobile computing . this mobilization is troublesome for doing mobile computing is related to resaving information from database mobilization the system during transaction causes of disconnection of mobile system with wireless network users and this disconnection due to transaction abort and mobile system have to redo transaction from start. One of methods of prevention of transaction abort prediction and sending Appling additional information for mobile system in order to prevention of transaction abort during disconnection of mobile system with wireless network until connection with the next wireless network during mobilization .our goal of this work is presentation of solution for prediction information for sending mobile system in order to use cache operation with usage Genetic algorithms.
Segmentation and Automated Social Hierarchy Detection through Email Network Analysis
Authors: Germán Creamer, Ryan Rowe, Shlomo Hershkop, Salvatore J. Stolfo
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 present our work on automatically extracting social hierarchies from electronic communication data. Data mining based on user behavior can be leveraged to analyze and catalog patterns of communications between entities to rank relationships. The advantage is that the analysis can be done in an automatic fashion and can adopt itself to organizational changes over time.We illustrate the algorithms over real world data using the Enron corporation's email archive. The results show great promise when compared to the corporations work chart and judicial proceeding analyzing the major players.
Knowledge structure, knowledge granulation and knowledge distance in a knowledge base
Authors: Yuhua Qian, Jiye Liang, Chuangyin Dang
Venue: International Journal of Approximate Reasoning (2009)

One of the strengths of rough set theory is the fact that an unknown target concept can be approximately characterized by existing knowledge structures in a knowledge base. Knowledge structures in knowledge bases have two categories: complete and incomplete. In this paper, through uniformly expressing these two kinds of knowledge structures, we first address four operators on a knowledge base, which are adequate for generating new knowledge structures through using known knowledge structures. Then, an axiom definition of knowledge granulation in knowledge bases is presented, under which some existing knowledge granulations become its special forms. Finally, we introduce the concept of a knowledge distance for calculating the difference between two knowledge structures in the same knowledge base. Noting that the knowledge distance satisfies the three properties of a distance space on all knowledge structures induced by a given universe. These results will be very helpful for knowledge discovery from knowledge bases and significant for establishing a framework of granular computing in knowledge bases.
The Voronoi Diagram of Circles and Its Application to the Visualization of the Growth of Particles
Authors: François Anton, Darka Mioc, Christopher Gold
Venue: Transactions on Computational Science III (2009)

Circles are frequently used for modelling the growth of particle aggregates through the Johnson-Mehl tessellation, that is a special instance of the Voronoi diagram of circles. Voronoi diagrams allow one to answer proximity queries after locating a query point in the Voronoi zone it belongs to. The dual graph of the Voronoi diagram is called the Delaunay graph. In this paper, we first show a necessary and sufficient condition of connectivity of the Voronoi diagram of circles. Then, we show how the Delaunay graph of circles (the dual graph of the Voronoi diagram of circles) can be computed exactly, and in a much simpler way, by computing the eigenvalues of a two by two matrix. Finally, we present how the Voronoi diagram of circles can be used to model the growth of particle aggregates. We use the Poisson point process in the Voronoi diagram of circles to generate the Johnson-Mehl tesselation. The Johnson-Mehl model is a Poisson Voronoi growth model, in which nuclei are generated asynchronously using a Poisson point process, and grow at the same radial speed. Growth models produce spatial patterns as a result of simple growth processes and their visualization is important in many technical processes.
Expert recommender systems in practice: evaluating semi-automatic profile generation
Authors: Tim Reichling, Volker Wulf
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Expert recommender systems (ERS) are considered a promising technology in knowledge management. However, there are very few studies which evaluated their appropriation in practice. In this paper, we present results of a case study of expert recommender technology in a large European industrial association. Unlike existing expert recommender approaches, the system involves users in selecting textual documents for semi-automatic profile generation. Our study focuses on the appropriation of this functionality and discusses impacts from an organizational perspective.