ppxscal/embedding_network huggingface dataset:
A Study on New Low-Cost RFID System with Mutual Authentication Scheme in Ubiquitous
Authors: Soo-Young Kang, Im-Yeong Lee
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The RFID system, a core technology used in building a ubiquitous environment utilizing radio frequency identification, is an alternative to bar-codes. The RFID system has become very popular, with various strengths such as recognition speed and non-touch method. However, there are some problems remaining as the low-cost tag can be operated through query, which leads to information exposure and privacy encroachment. Various approaches have been used to increase security of the system, but the low-cost tag, which has about 5K~10K gate capabilities, can only allocate 250~3K gate to security. Therefore, the current study will provide a reciprocal authentication solution that can be used with low-cost RFID systems, by separating 64 bit keys and minimizing calculations. Existing systems divided a 96 bit key into 4 parts. However, the proposed system reduces the key to 32 bits, and reduces the communications down to 5 from 7. Also, one additional random number is added to the existing two numbers to increase security. To improve the previous system, which only provided XOR calculations, an additional hash function was added. The added procedure does not increase effectiveness, compared to the XOR calculation, but does provide more security to the RFID system, which can be used in remote distances.
Using Fibonacci Compression Codes as Alternatives to Dense Codes
Authors: Shmuel T. Klein, Miri Kopel Ben-Nissan
Venue: Proceedings of the Data Compression Conference (2008)

Recent publications advocate the use of various variable length codes for which each codeword consists of an integral number of bytes in compression applications using large alphabets. This paper shows that another tradeoff with similar properties can be obtained by Fibonacci codes. These are fixed codeword sets, using binary representations of integers based on Fibonacci numbers of order m ≥ 2. Fibonacci codes have been used before, and this paper extends previous work presenting several novel features. In particular, they compress better and are more robust, at the price of being slower.
Energy-Efficient Optimal Real-Time Scheduling on Multiprocessors
Authors: Kenji Funaoka, Shinpei Kato, Nobuyuki Yamasaki
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Optimal real-time scheduling is effective to not only schedulability improvement but also energy efficiency for real-time systems. In this paper, we propose real-time static voltage and frequency scaling (RT-SVFS) techniques based on an optimal real-time scheduling algorithm for multiprocessors. The techniques are theoretically optimal when the voltage and frequency can be controlled both uniformly and independently among processors. Simulation results show that the independent RT-SVFS technique closely approaches the lower bound on energy consumption if the voltage and frequency can be controlled minutely.
Walking your dog in the woods in polynomial time
Authors: Erin Wolf Chambers, Éric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

The Fréchet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Fréchet distance to more general metric spaces, which requires the leash itself to move continuously over time. For example, for curves in the punctured plane, the leash cannot pass through or jump over the obstacles ("trees"). We describe a polynomial-time algorithm to compute the homotopic Fréchet distance between two given polygonal curves in the plane minus a given set of obstacles, which are either points or polygons.
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Authors: Tianyi Wu, Dong Xin, Jiawei Han
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where ranking is on multidimensional aggregates instead of on measures of base facts. To address this problem, we propose a query execution model to answer different types of ranking aggregate queries based on a unified, partial cube structure, ARCube. The query execution model follows a candidate generation and verification framework, where the most promising candidate cells are generated using a set of high-level guiding cells. We also identify a bounding principle for effective pruning: once a guiding cell is pruned, all of its children candidate cells can be pruned. We further address the problem of efficient online candidate aggregation and verification by developing a chunk-based execution model to verify a bulk of candidates within a bounded memory buffer. Our extensive performance study shows that the new framework not only leads to an order of magnitude performance improvements over the state-of-the-art method, but also is much more flexible in terms of the types of ranking aggregate queries supported.
Improving behavioral based job assignment by using radial basis function network
Authors: A. Hajiha, S. H. Alavi, P. Makvandi
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

Within the past century, many management researchers have worked on a different model for evaluating and selecting suitable individuals for different jobs. They have studied this issue from different view points and proposed numerous models in different fields such as industrial psychology, human resources management, organizational behavior, etc. But the proposed models in each field are generally qualitative, and quantitative models that have been less used were not able to solve the qualify matters. One field which has been much ignored relates the study of behavioral indices of the employee or applicants and their compatibility with the certain jobs. To solve this problem, in this paper a neural network model is design and use to assign individuals to jobs optimally on the basis of individual's merit. In the introduce model first determining the standard values of behavioral features required for different jobs by referring experts. Then through relevant behavioral tests, the behavioral indices of the applicants will be evaluated, and the results will be compared with a neural network model that made from the view points of expert. Finally, the result is used by a linear assignment technique to select qualified individuals for different jobs.
Block preconditioning for saddle point systems with indefinite (1, 1) block
Authors: Michele Benzi, Jia Liu
Venue: International Journal of Computer Mathematics (2007)

We investigate the solution of linear systems of saddle point type with an indefinite (1, 1) block by preconditioned iterative methods. Our main focus is on block matrices arising from eigenvalue problems in incompressible fluid dynamics. A block triangular preconditioner based on an augmented Lagrangian formulation is shown to result in fast convergence of the GMRES iteration for a wide range of problem and algorithm parameters. Some theoretical estimates for the eigenvalues of the preconditioned matrices are given. Inexact variants of the preconditioner are also considered.
A Meta Hardware Description Language Melasy for Model-Checking Systems
Authors: Naoki Iwasaki, Katsumi Wasaki
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Model-checking tools such as Symbolic Model Verifier (SMV) and NuSMVare available for checking hardware designs. These tools can automatically check the formal legitimacy of a design. However, NuSMV is too low level for describing a complete hardware design. It is therefore necessary to translate the system definition, as designed in a language such as Verilog or VHDL, into a language such as NuSMV for validation. In this paper, we present a meta hardware description language, Melasy, that contains a code generator for existing hardware description languages (HDLs) and languages for model checking that solve this problem.
An unbiased algorithm for detection of curvilinear structures in urban remote sensing images
Authors: J. Peng, Y. -Q. Jin
Venue: International Journal of Remote Sensing (2007)

Based on the Gaussian scale-space, a Gaussian comparison function is presented for extracting the linearly road features in aerial remote sensing image. Combining the geometric and radiometric features, the curvilinear structures of the roads are extracted based on locally oriented energy in continuous scale-space. Curvilinear features of roads are verified, grouped and extracted by using both topologic and geometric methods. This algorithm is applicable to extracting the road features in different scale such as rural roads or urban highways, and significantly reduces the computation complexity of line tracing. Some discussions on the zero drift of the Gaussian comparison function are also presented.
Inversion of the Radon transform on the product Laguerre hypergroup by using generalized wavelets
Authors: Pei Liu, Jianxun He
Venue: International Journal of Computer Mathematics (2007)

Let H1 be the three-dimensional Heisenberg group. The fundamental manifold of the radial function space for H1 can be denoted by [0, ∞)×R, which is just the Laguerre hypergroup. Naturally, Kn=[0, ∞)n×Rn is the product Laguerre hypergroup. In this paper, we give the theory of continuous wavelet analysis and the Radon transform on Kn, and devise a subspace SR(Kn) of S(Kn) (Schwartz space) on which the Radon transform is a bijection. Also, we give two equivalent characterizations on S(Kn) for the Radon transform. By using the inverse wavelet transform we establish an inversion formula of the Radon transform on Kn in the weak sense.
Performance Optimization of Temporal Reasoning for Grid Workflows Using Relaxed Region Analysis
Authors: Ke Xu, Junwei Cao, Lianchen Liu, Cheng Wu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With quick evolution of grid technologies and increasing complexity of e-Science applications, reasoning temporal properties of grid workflows to ensure reliability and trustworthiness is becoming a critical issue. Relaxed Region Analysis (RRA) is proposed in this work for performance optimization of grid workflow verification by decomposing workflows into separate standard regions with parallel branches. The approach is implemented in GridPiAnalyzer, a Pi Calculus based formal verifier for grid workflows, and validated using gravitational wave data analysis workflows. Detailed experimental results illustrate that RRA can dramatically reduce CPU and memory usage of verification processes.
Design Margin Exploration of Spin-Torque Transfer RAM (SPRAM)
Authors: Yiran Chen, Xiaobin Wang, Hai Li, Harry Liu, Dimitar V. Dimitrov
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

We proposed a combined magnetic and circuit level technique to explore the design methodology of Spin-Torque Transfer RAM (SPRAM). A dynamic magnetic model of magnetic tunneling junction (MTJ), which is based upon measured spin torque induced magnetization switching behavior, is also proposed. The response of CMOS circuitry is characterized by SPICE and used as the input of our MTJ model to simulate the dynamic behavior of SPRAM cell. By using this technique, we explored the design margin of SPRAM cell with one-transistor-one-MTJ (1T1J) structure. Simulation results show that our technique can significantly reduce the design pessimism, compared to conventional SRPAM cell model.
Applications of orthogonal polynomials
Authors: Maitree Podisuk, Witchaya Rattanametawee, Decha Samana
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Orthogonal polynomials appear frequently in applied mathematics. In this paper, we will introduce two sequences of orthogonal polynomials on the interval [0,1]. The orthogonal polynomials of each type up to degree seven will be illustrated. We will use these fourteen orthogonal polynomials to obtain fourteen Gaussian quadrature formulas and fourteen formulas of Runge-Kutta type for solving the initial value problem of ordinary differential equation. Some examples will be given.
Fabrication of Bragg gratings with deep grooves in LiNbO3 ridge optical waveguide
Authors: A. Suzuki, T. Iwamoto, A. Enokihara, H. Murata, Y. Okamura
Venue: Microelectronic Engineering (2008)

The fabrication of LiNbO"3 (LN) Bragg gratings, which have the grooves of 400nm depth, in LN ridge optical waveguide is shown in this paper. The 400nm depth grooves in LN Bragg gratings with high uniformity, precision and no damage were achieved for the first time. In order to fabricate the fine structure of LN Bragg gratings, we optimized the condition for LN dry etching and introduced the Cr metal as a mask material to our fabrication process. We also have investigated the favorable structure to realize the large optical group delay and discussed the importance to fabricate the Bragg gratings with deep grooves. We successfully fabricated Bragg gratings in LN ridge optical waveguide and demonstrated the measurement of transmission property. The etching process developed in this paper brought good performance to the fabrication of the deep grooves in LN Bragg gratings. From these results, the possibility of large group delay and slow-wave electro-optic modulators in LN optical waveguides was revealed.
Trust and Autonomic Systems
Authors: H. Lutfiyya, M. Perry, C. Yew
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

This paper is a discussion at a theoretical level of creating trust in autonomic systems. The paper focuses especially in creating trust in the policies being used. Policies are an integral part of autonomic systems since they allow for adaptability.
Nondeterministic exponential time has two-prover interactive protocols
Authors: L. Babai, L. Fortnow, C. Lund
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The exact power of two-prover interactive proof systems (MIP) introduced by M. Ben-Or et al. (Proc. 20th Symp. on Theory of Computing, 1988, p.113-31) is determined. In this system, two all-powerful noncommunicating provers convince a randomizing polynomial-time verifier in polynomial time that the input x belongs to the language L. It was previously suspected (and proved in a relativized sense) that coNP-complete languages do not admit such proof systems. In sharp contrast, it is shown that the class of languages having two-prover interactive proof systems is computable in nondeterministic exponential time (NEXP). This represents a further step demonstrating the unexpectedly immense power for randomization and interaction in efficient provability.
The intrinsic dimensionality of graphs
Authors: Robert Krauthgamer, James R. Lee
Venue: Combinatorica (2007)

We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occurs as a (not necessarily induced) subgraph of &#x2124;&#x221e; d , the infinite graph with vertex set &#x2124; d and an edge (u, v) whenever &#x2225;u &#x2212; v&#x2225;&#x221e; = 1. The growth rate of G, denoted &#x03c1; G , is the minimum &#x03c1; such that every ball of radius r > 1 in G contains at most r &#x03c1; vertices. By simple volume arguments, dim(G) = &#x03a9;(&#x03c1; G ). Levin conjectured that this lower bound is tight, i.e., that dim(G) = O(&#x03c1; G ) for every graph G. Previously, it was unknown whether dim(G) could be bounded above by any function of &#x03c1; G . We show that a weaker form of Levin&#x2019;s conjecture holds by proving that dim(G) = O(&#x03c1; G log &#x03c1; G ) for any graph G. We disprove, however, the specific bound of the conjecture and show that our upper bound is tight by exhibiting graphs for which dim(G) = &#x03a9;(&#x03c1; G log &#x03c1; G ). For several special families of graphs (e.g., planar graphs), we salvage the strong form, showing that dim(G) = O(&#x03c1; G ). Our results extend to a variant of the conjecture for finite-dimensional Euclidean spaces posed by Linial and independently by Benjamini and Schramm.
When Do You Pay? The Business Impact of Payment Time Perception
Authors: Eric Wing Kuen See-To
Venue: Electronic Markets (2007)

Recent advances in consumer research have shown that the billing schedule has a significant impact on consumer decisions and consumption patterns. The strategy of devising different billing schedules to influence a customer's purchase decision (or choice of consumption pattern) is well accepted, and should be effective as long as billing schedules are exactly the same as the perceived payment outlays. Payment card technology makes the payment time perceived by consumers ambiguous and may enable the decoupling of payment outlay and billing schedule. If the decoupling hypothesis is supported, customers will no longer be subject to mental account manipulation by the payment scheme. Working with a large electronic payment service provider, we conducted a survey to collect data on usage and perception of payment cards in late 2003. Our results strongly support the decoupling hypothesis, and firms need to rethink their bundling and pricing strategies based on billing schedules. The possible use of this decoupling phenomenon to increase the willingness to pay of consumers and other managerial implications are discussed.
On Constructing High Performance Overlay for Layered Streaming in Heterogeneous Networks
Authors: Xin Xiao, Yuanchun Shi, Zhijia Chen, Baopeng Zhang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper presents the mechanism and evaluation of a Qos-aware Overlay Construction Approach for Layered Streaming, called OCals. The motivation originates from the lack of overlay construction method suitable for layered streaming, because in previous works 1) A newly joining node selects neighbors just based on their network conditions, ignoring a neighbor with good network condition may be unable to provide sufficient layers. 2) Newly joining nodes usually select nodes that can provide good QoS as neighbors to improve its own performance but are not utilized to improve existing poor nodes. Therefore, OCals is proposed, whose basic idea and main contribution come in two-fold: 1) During neighbor selection, existing nodes’ network conditions and providing layers are considered as a whole; 2) OCals guarantees the QoS for new node and also improves the QoS for existing overlay. Ocals is easy to implement with low time cost, and has been implemented within our layered streaming architecture on Internet. Experiments demonstrate that compared with two other classic approaches of SCAMP and Narada, the throughput and packet delay of the layered streaming on top of the overlay constructed by OCals can be remarkably improved, with low time cost for joining/recovery process.
A survey of top-k query processing techniques in relational database systems
Authors: Ihab F. Ilyas, George Beskales, Mohamed A. Soliman
Venue: ACM Computing Surveys (CSUR) (2008)

Efficient processing of top-k queries is a crucial requirement in many interactive environments that involve massive amounts of data. In particular, efficient top-k processing in domains such as the Web, multimedia search, and distributed systems has shown a great impact on performance. In this survey, we describe and classify top-k processing techniques in relational databases. We discuss different design dimensions in the current techniques including query models, data access methods, implementation levels, data and query certainty, and supported scoring functions. We show the implications of each dimension on the design of the underlying techniques. We also discuss top-k queries in XML domain, and show their connections to relational approaches.
Variability in Behavior of Command Agents with Human-Like Decision Making Strategies
Authors: Masood Raza, Venkat V. S. S. Sastry
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Human behavior representation in military simulations is not sufficiently realistic, specially the decision making in synthetic military commanders. One of the problems in decision making is that the decisions are predictable. In order to address some of these deficiencies, we have developed a computer implementation of Recognition Primed Decision (RPD) making model using Soar cognitive architecture and it is referred to as RPD-Soar agent in this paper. The proposed implementation is evaluated using prototypical scenarios arising in command decision making in tactical situations. Due to the ability of the RPD-Soar agent to mentally simulate applicable courses of action it is possible for the agent to handle new situations very effectively using its prior knowledge. The variability in behavior within an agent is a desirable characteristic. Variability in agents may be produced through randomness but randomness also introduces undesirable behavior. The observed variability in the RPD-Soar agent is due to reasonable but some times sub-optimal choices given to the agent. RPD-Soar agent developed in this paper exhibits the ability to change decision making strategy with experience. And the preliminary results clearly demonstrate the ability of the model to represent human behavior variability within and across individuals.
Arbitrary Lagrangian-Eulerian method for coupled Navier-Stokes and convection-diffusion equations with moving boundaries
Authors: Liliana Braescu, Thomas F. George
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

Using the arbitrary Lagrangian-Eulerian method, an accurate description of the melt flow and impurity distribution in a time-dependent domain Ω(t), t ∈[0, T], is performed. The procedure is developed for a crystal fiber grown from the melt by the edge-defined film-fed growth (EFG) technique, on the basis of the finite-element method using COMSOL Multiphysics software. For this, an EFG system without melt replenishment (the melt level in the crucible decreases in time) is considered. By coupling three application modes - incompressible Navier-Stokes, moving mesh arbitrary Lagrangian-Eulerian, and convection-diffusion - it is illustrated, in the time-dependent case, how the pull of the crystal, with a constant rate vin, generates the fluid flow, and it is shown how the resulting fluid flow and deformed geometry determine the impurity distribution in the melt and in the crystal.