ppxscal/embedding_network huggingface dataset:
A new front-tracking method to model anisotropic grain and phase boundary motion in rocks
Authors: J. K. Becker, P. D. Bons, M. W. Jessell
Venue: Computers Geosciences (2008)

Microstructures of rocks play an important role in determining rheological properties and help to reveal the processes that lead to their formation. Some of these processes change the microstructure significantly and may thus have the opposite effect in obliterating any fabrics indicative of the previous history of the rocks. One of these processes is grain boundary migration (GBM). During static recrystallisation, GBM may produce a foam texture that completely overprints a pre-existing grain boundary network and GBM actively influences the rheology of a rock, via its influence on grain size and lattice defect concentration. In this paper we present a new front-tracking method to simulate GBM. Generally, any movement of boundaries is driven by the minimisation of the internal free energy of a system. The new method moves boundaries along the energy gradient towards a lower total energy state of the system. The calculation of the energy gradient is not necessarily limited to (an)isotropic boundary energies but may also include metamorphism, melting, reaction energies, surface energies and elastic stresses, etc. Two examples are included in this paper where we simulate grain growth with isotropic boundary energy functions and grain growth with isotropic and anisotropic boundary energy functions in a system with a melt present.
The impact of software radio on wireless networking
Authors: Vanu G. Bose
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

A software radio is a wireless communications device in which some or all of the physical layer functions are implemented in software. The flexibility provided by the software implementation enables a single device to interoperate with other devices using different wireless physical layer technologies, by simply invoking the appropriate software. A mobile computing device equipped with a software radio would have access to a wide range of connectivity options including cellular, wireless LAN and satellite systems. This would not only enable seamless anytime, anywhere connectivity, but also provide users the flexibility of choosing from the available connectivity options to best suit their price/performance requirements. Most software radio research to date has been driven by military and commercial cellular applications. Mobile networking applications require additional functionality present new software radio design constraints. This paper reviews existing software radio research, describes the SpectrumWare software radio system and identifies some important research challenges that must be addressed in order to apply software radio research to mobile networking applications.
Autocorrelation Peaks in Congruential Pseudorandom Number Generators
Authors: F. Neuman
Venue: IEEE Transactions on Computers (1976)

One of the desirable properties of a pseudorandom number generator is that the sequence of numbers it generates should have very low autocorrelation for all shifts except for zero shift and those that are multiples of its cycle length. Due to the simple methods of constructing random numbers via modulo arithmetic, the ideal is often not quite fulfilled. The results of this paper were obtained by the simple method of examining the complete correlation structure of several generators of the same type and small cycle length. Once the regularities were discovered, the mathematical relationships were derived which describe the regular behavior for all generators of the same class. As examples, it is shown in this paper that high correlation exists in mixed and multiplicative congruential random number generators and prime moduli Lehmer generators for shifts a fraction of their cycle lengths.
A Temporal Meta Database System for 3D Objects
Authors: Vo Thi Ngoc Chau, Suphamit Chittayasothorn
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Nowadays, semantic information accompanying 3D graphical data, which is called metadata, has been realized to be essential for several purposes such that available 3D graphical data can be indexed and retrieved by means of its metadata and then other applications can make use of the 3D graphical data efficiently. Even though a number of works have focused on this topic so far, no temporal aspect of 3D graphical data has been taken into account. Especially no complete automatic metadata extraction process has been proposed. A manual process is possible with a small amount of 3D graphical data while impossible with a larger amount. Therefore, the manual process gets heavy and the cost in time and effort is so much required. In such a context, we introduce for 3D graphical data a temporal meta database system where an automatic metadata extraction method takes into consideration the temporal aspect of 3D graphical data. 3D graphical data is arranged in a scene formatted in the standard language VRML. Semantic information of the scene, i.e. metadata, will be automatically achieved. The structure of scene metadata is handled by using the temporal NIAM object oriented conceptual schema model at the abstraction level so that the semantic scene information can get more understandable to users, graphics designers, and application programmers as well. As a result, scene metadata is able to be easily stored and queried by means of some standardized database language such as SQL or OQL. With the aid of the extracted scene metadata, the respective 3D scenes are now exactly and conveniently accessed by other applications such as a virtual guide in transportation, architecture, tourism, etc.
Analysis of Communication Traffic Characteristics of Two-hop-relay Cellular System in the Dead Spots
Authors: Wei-feng Lu, Meng Wu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In traditional cellular systems, the call requests initiated by mobile stations (MSs) must be carried through a base station (BS) via the cellular interface, but when MSs are located in the dead spots, their call requests will be blocked because the MSs cannot communicate with the BS. It is considered to relay these blocked communication traffic by using ad hoc relaying, which will improve the performance of the system as a whole. This paper firstly introduces a novel architecture of two-hop-relay cellular system, and analyzes the communication traffic characteristics of the traditional cellular system and two-hop-relay cellular system respectively in the dead spots environment. Numerical results show that the two-hop-relay cellular system outperforms the traditional cellular system in terms of the call blocking rate when considering the impact of dead spots.
Getting Rid of Straitjackets for Flexible Integrity Checking
Authors: Hendrik Decker, Davide Martinenghi
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Various requirements that usually are imposed on data, constraints, updates and methods for checking the integrity of databases can be perceived as inflexible straitjackets. We show that such restrictions can be notably relaxed or even completely abandoned without forfeiting any major advantage. On the contrary, a significant amount of flexibility is gained by relaxing or abandoning several established prerequisites for integrity checking.
Towards Semi-Automatic Generation of Provably Correct Algorithmic Programs
Authors: Haihe Shi, Jinyun Xue
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The paper gives an overview of a PAR-based Algorithm Design System PADS. PADS provides formal and semi-automatic support for the generation of algorithmic programs as well as loop invariants. It has several extensible built-in libraries that contain strategies and rules for PAR-based algorithm design. To illustrate the use of PADS, an example is given. PADS aims to bring a mechanizable and unified development process which starts from a high-level specification and results in provably correct products, meanwhile enables users with little mathematical knowledge about formal methods to develop algorithmic programs efficiently.
Mine Fan Intelligent Faults Diagnosis Based on the Lifting Wavelet Packet and RBF Neural Network
Authors: Junfa Leng, Donghai Chen, amd Shuangxi Jing
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In order to overcome the disadvantage of traditional methods of fault features extraction, and realize the on- line and intelligent fault diagnosis, a new method of feature extraction based on the lifting wavelet packet transform was presented, with which fault feature factors were extracted from three typical running states of mine fan. The fault feature factors can be taken as the input samples of RBF neural network, which realized the intelligent fault diagnosis of mine fan. The results showed that the combinative method of the lifting wavelet packet decomposition and RBF neural network can reduce the need of time and memory greatly, and it is very fit for the real-time and intelligent conditions monitoring and fault diagnosis of machinery system. Index Terms Lifting Wavelet Packet Transform; RBF Neural Network; Fault Diagnosis
A BeepBeep ranging system on mobile phones
Authors: Chunyi Peng, Guobin Shen, Zheng Han, Yongguang Zhang, Yanlin Li, Kun Tan
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

The demo, BeepBeep, shows a high-accuracy acoustic-based ranging system without relaying on any pre-planned infrastructure or inter-device time synchronization. Moreover, the BeepBeep is a pure software-based solution and readily applicable to many low-cost sensor platforms and to most commercial-off-the-shelf mobile devices. Our demo using two common cell phones shows that BeepBeep can achieve average two centimeters accuracy within a range of more than ten meters.
The evolving art of packet switching
Authors: J. W. Atkins, N. J. Cooper, K. E. Gleen
Venue: BT Technology Journal (2007)

Rapid developments in computer and information technology continue to expose new requirements for switched data services, e.g. teletext, electronic funds transfer, electronic mail. The features of packet switching make it attractive for many of these new services, and many countries, including the UK, now operate or plan to introduce public packet-switched data networks. But packet switching is a relatively new art, particularly in the realm of public-switched networks, and is itself developing rapidly, driven both by the increasing demand for switched data services and by advances in semiconductor technology. It tends therefore to be the preserve of a relatively small band of specialists. This paper reviews the principles, origins and evolution of packet switching, with particular reference to public-switched networks. The picture emerges of well laid foundations and the prospect of rapid expansion in public packet-switched networks throughout the world. The development of large switches, such as those being developed at BTRL, will play an important part in this.
Nash equilibria in random games
Authors: Imre Bárány, Santosh Vempala, Adrian Vetta
Venue: Random Structures Algorithms (2007)

We consider Nash equilibria in 2-player random games and analyze a simple Las Vegas algorithm for finding an equilibrium. The algorithm is combinatorial and always finds a Nash equilibrium; on m &times; n payoff matrices, it runs in time O(m2nloglog n + n2mloglog m) with high probability. Our result follows from showing that a 2-player random game has a Nash equilibrium with supports of size two with high probability, at least 1 - O(1&#x002F;log n). Our main tool is a polytope formulation of equilibria. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Anomalous Behavior of Synchronizer and Arbiter Circuits
Authors: T. J. Chaney
Venue: IEEE Transactions on Computers (1973)

Observations are shown of oscillatory and metastable behavior of flip-flops in response to logically undefined input conditions such as those that occur in synchronizers and arbiters. Significant systems failures have resulted from this fundamentally inescapable problem that is generally not appreciated by system designers and users.
A Resource-based Reputation Rating Mechanism for Peer-to-Peer Networks
Authors: Huan Chen, Guihai Chen
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

As various kinds of peer-to-peer (P2P) applications become popular and widely known to people all around the world, research on P2P networks has received considerable interest. Recent studies show that various problems like free-riding and content pollution have influenced the working performance and development of P2P networks. In this paper, we propose a distributed, resource-based reputation rating mechanism to improve the chance that participating peers get authentic resources in a content polluted environment. The rating mechanism can be widely applied to different peer-to-peer networks. Simulation results show that the rating mechanism effectively helps nodes to construct right view towards other nodes and protects honest nodes from polluted contents.
Adaptive Self Type Changing Strategy of Incarnation for Maintaining Optimal Intelligent Information System
Authors: Jeong Yon Shim
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Everything in the world has own properties and interacts with other things dynamically. By their associative relationship they are linked , sometimes combined and separated. These features make a living thing possible to survive in the complex environment. In the case of a sudden change and a barren environment, the living things change their characteristics and adapt their way of life to a new environment. As more computational virtual environment is developed rapidly, the requirement of intelligent system adopting the properties of living things is getting high. Accordingly in this paper for making more efficient intelligent system, Adaptive Self Type changing strategy of incarnation for maintaining optimal Intelligent Information System was proposed by defining their own types and SEG(Surviving Energy Gauge) of knowledge cell. We apply this system to the virtual memory and show testing results.
AbIx: an approach to content-based approximate query processing in peer-to-peer data systems
Authors: Chao-Kun Wang, Jian-Min Wang, Jia-Guang Sun, Sheng-Fei Shi, Hong Gao
Venue: Journal of Computer Science and Technology (2007)

In recent years there has been a significant interest in peer-to-peer (P2P) environments in the community of data management. However, almost all work, so far, is focused on exact query processing in current P2P data systems. The autonomy of peers also is not considered enough. In addition, the system cost is very high because the information publishing method of shared data is based on each document instead of document set. In this paper, abstract indices (AbIx) are presented to implement content-based approximate queries in centralized, distributed and structured P2P data systems. It can be used to search as few peers as possible but get as many returns satisfying users' queries as possible on the guarantee of high autonomy of peers. Also, abstract indices have low system cost, can improve the query processing speed, and support very frequent updates and the set information publishing method. In order to verify the effectiveness of abstract indices, a simulator of 10,000 peers, over 3 million documents is made, and several metrics are proposed. The experimental results show that abstract indices work well in various P2P data systems.
Survey of Public Key Digital Watermarking Systems
Authors: Rongsheng Xie, Keshou Wu, Jiangbo Du, Chunguang Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In traditional symmetric watermarking schemes, the key used for watermark embedding must be available at the watermark detector. This leads to a security problem if the detectors are implemented in consumer devices that are spread all over the world. So asymmetric watermarking schemes, also named public key digital watermarking schemes attract more and more attentions. In such a public key watermarking system, the private key is used for watermarking embedding and the public key is used only for watermarking detection. The private key is kept for secret, and the watermarks cannot easily be removed with public key. Several latest proposed public key watermarking schemes are reviewed in the paper, and their performances are analyzed.
Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations
Authors: O. A. Yemets, N. Yu. Ust'Yan
Venue: Cybernetics and Systems Analysis (2007)

The paper is concerned with an optimization problem on game-type permutations, where one or both players have combinatorial constraints on their strategies. A mathematical model of such problems is constructed and analyzed. A modified graphical method is proposed to solve (2xn)-and (mx2)-dimensional problems. High-dimensional problems are reduced to linear programming and combinatorial optimization problems.
Fabrication of soft reflective microoptical elements using a replication process
Authors: Teng-Kai Shih, Jeng-Rong Ho, Jui-Hao Wang, Chia-Fu Chen, Chueh-Yang Liu, Chien-Chung Chen, Wha-Tzong Whang
Venue: Microelectronic Engineering (2008)

This paper reports the fabricated method and optical performance of soft, reflective elements with nonspherical surface. Based on excimer laser microdrilling and spin coating processes, a PMMA film suspended on microdrilled holes was used as a concave mold. Then, a high-reflectance material, mixed PDMS rubber polymers with TiO"2 nanoscale powders, was cast on the PMMA mold. Finally, both of concave and convex elements could be fabricated through soft replica molding processes and these elements could directly reflect light without the deposition of metal coatings. Therefore, we proposed a model regarding a flexible cable with its weight suspended on fixed points to explain the formation mechanism of PMMA molds. With the change of diameters of microholes and thicknesses of PMMA films, the suspended height of films was surely controllable. Therefore, the curvature radiuses and shapes of these aspherical elements also depended on the diameters of microholes and the thicknesses of PMMA films. Experimental results demonstrated that soft reflective elements have good surface qualities and high-quality optical properties. Besides, all fabrication steps can be executed in ambient environment and at low temperature, the proposed method has a potential for mass production.
Challenges to Accuracy for the Design of Deep-Submicron RF-CMOS Circuits
Authors: S. Yoshitomi
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Two challenges for the accurate prediction of GHz CMOS analog/RF building blocks are presented. Challenging the usage of new compact MOSFET models enhances the simulation accuracy. The capability of EKV3.0 model has been studied by applying to TOSHIBA'S 130nm RF-CMOS technology. The verification facts have shown that EKV3.0 model offered excellent modeling capability of both DC and RF (small and large signal). Challenging the efficient use of electro-magnetic (EM) with one practical setup offered successful prediction of the EM effects in the chip. Enhanced study of EM co-simulation technique that links two challenges had shown the perfect prediction of the TOSHIBA'S RF-CMOS circuit (VCO).
An early application of the Bell Labs Security framework to analyze vulnerabilities in the Internet telephony domain
Authors: Vijay K. Gurbani, Andrew R. McGee
Venue: Bell Labs Technical Journal (2007)

The Bell Labs Security Framework provides a comprehensive matrix that can be used to evaluate the security of an application (service), host, protocol, or communication link. The methodology has been used to assess the security of information technology (IT) and telecommunications services, as well as technologies such as Institute of Electrical and Electronics Engineers (IEEE) 802.11. The goal of this paper is to provide systems designers and researchers with a methodology to gauge where the Internet telephony industry, products, and protocols are in terms of security with the hope of prioritizing future needs and establishing a baseline measurement for potential changes. The methodology itself consists of cataloging a body of observed attacks against Internet telephony systems over the standard definitions from the framework. This is an early work that aims to quantify where in the framework security attacks on Internet telephony infrastructure appear. We envision that on the basis of data collected over a prolonged period, it will be feasible to determine the set of intersection of the layer and plane at which such attacks are clustered and thus proactively put safeguards in products to thwart such attacks. &copy; 2007 Alcatel-Lucent.
An e-learning tool based on morphisms for teaching object oriented programming
Authors: Inés Friss de Kereki, Carlos Nicolás Fornaro, Javier Azpiazu, José Crespo
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

When designing software, a correspondence between the particular situation and the model should be established. Morphism may be defined generally as a mapping from one element of a domain into another. It is more detailed and specific than the concept of abstraction. It is considered that use of morphisms can be useful for development of mental models and learning strategies to analyze and build adequate software models. This investigation extends a preliminary research work performed at ORT Uruguay University, during 2005. There, we verified that the use of morphisms helps to develop aforesaid models and strategies. We present the follow up of this investigation in this paper, defining components and elements needed for integrating information and communication technologies and the use of morphisms in an e-learning model. We also implemented a specific tool for promoting model related skills based on the explicit use of morphisms. The results of the experimentation showed that the use of this tool can be useful for analyzing and building adequate software models.
Generalized multiscale radial basis function networks
Authors: Stephen A. Billings, Hua-Liang Wei, Michael A. Balikhin
Venue: Neural Networks (2007)

A novel modelling framework is proposed for constructing parsimonious and flexible multiscale radial basis function networks (RBF). Unlike a conventional standard single scale RBF network, where all the basis functions have a common kernel width, the new network structure adopts multiscale Gaussian functions as the bases, where each selected centre has multiple kernel widths, to provide more flexible representations with better generalization properties for general nonlinear dynamical systems. As a direct extension of the traditional single scale Gaussian networks, the new multiscale network is easy to implement and is quick to learn using standard learning algorithms. A k-means clustering algorithm and an improved orthogonal least squares (OLS) algorithm are used to determine the unknown parameters in the network model including the centres and widths of the basis functions, and the weights between the basis functions. It is demonstrated that the new network can lead to a parsimonious model with much better generalization property compared with the traditional single width RBF networks.