ppxscal/embedding_network huggingface dataset:
An anonymous communication model for privacy-enhanced location based service using an echo agent
Authors: Eun-Ae Cho, Chang-Joo Moon, Hyun-Soo Im, Doo-Kwon Baik
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

A ubiquitous computing environment provides comfortable conditions for anyone to access diverse networks without being concerned about time, place, or device. The Location-Based Service (LBS), for example, provides various convenient services using an individual's location information. However, on the flip side of this convenience, if a user's location information is exposed, it can lead to serious privacy problems. This paper proposes an anonymous communication model that uses an echo agent for LBS to guarantee privacy. Located between the user and the service provider, the echo agent sends both the real user's route and dummy routes to prevent user location information from being grasped and traced by service providers. It maintains an effective data schema to collect, store, and use the users' past routes and dummy routes through the heuristic algorithm. Finally, it develops and applies the policies to manage them. Unlike existing methods, this model provides powerful anonymity because it generates dummy routes which are similar to the real routes of users. In addition, in terms of the simulation result for dummy generation, the proposed model reduces the probability of the wrong node generation to a tenth of the existing model's one. Thus, privacy of user location information can be protected via this method.
On Stateless Deterministic Restarting Automata
Authors: Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

The transitions of a stateless automaton do not depend on internal states but solely on the symbols currently scanned by its heads accessing the input or memory. We investigate stateless deterministic restarting automata that, after executing a rewrite step, continue to read their tape before performing a restart. Even the weakest class thus obtained contains the regular languages properly. The relations between different classes of stateless automata as well as between stateless automata and the corresponding types of automata with states are investigated, and it is shown that the language classes defined by the various types of deterministic stateless restarting automata without auxiliary symbols are anti-AFLs that are not even closed under reversal.
Cyclic delay diversity for V-BLAST OFDM system
Authors: Kwang Yoon Kim, Jin Young Kim
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Increasing demand for high performance of 4th generation (4G) broadband wireless communication system is enabled by the use of system that combines MIMO and OFDM. MIMO OFDM system can provide high data rate transmission and better performance over the fading channels. In a conventional MIMO OFMD system, multiple antennas can improve data rate, capacity and error rate. A recent trend of research on the MIMO OFDM system pays more attention to simplified implementation of receiver structure and to improve system performance. In this paper, we propose cyclic delay diversity for V-BLAST OFDM wireless system using turbo code in Rayleigh fading channel to improve an error performance of wireless system. We use multiple antennas at each layer in transmitter and turbo code as FEC. This structure can improve the error performance while the receiver structure is not changed. The error performance of the proposed system is analyzed and simulated in Rayleigh fading channel by computer simulation approaches.
Comparison about the Three Central Composite Designs with Simulation
Authors: Zhihong Zhang, Bai Xiaofeng
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

A comparative study of the three important Central Composite Designs(CCDs) in Response Surface Methodology (RSM) was presented. The three CCDs are Central Composite Circumscribed design (CCC), Central Composite Inscribed design(CCI) and Central Composite Face-centred design (CCF). Characteristics of the three designs were analyzed and guide lines were provided with some key concepts about CCDs. Then evaluation and comparison were made among CCC, CCI and CCF from the view of region of interest and robustness of design through simulation of a motor assembly. The results show that effective experiment of design cannot be gained without correct selection of CCC, CCI and CCF. Lastly, the guidelines for selecting CCDs were given. This study will provide better foundation for practice applications.
Solving the ocean color inverse problem by using evolutionary multi-objective optimization of neuro-fuzzy systems
Authors: Marco Cococcioni, Giovanni Corsini, Beatrice Lazzerini, Francesco Marcelloni
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

The ocean color inverse problem consists of determining the concentrations of optically active constituents, such as chlorophyll, suspended particulate matter and colored dissolved organic matter, from remotely sensed multispectral measurements of the reflected sunlight back-scattered by the water body. In this paper, we approach this regression problem by using an evolutionary multi-objective algorithm, namely the (2+2) Modified Pareto Archived Evolutionary Strategy ((2+2)M-PAES), to optimize Takagi-Sugeno type (TS-type) fuzzy rule-based systems (FRBSs). Accuracy and complexity are the two competitive objectives to be simultaneously optimized. TS-type FRBSs are implemented as an artificial neural network; by training the neural network, the parameters of the fuzzy model are adjusted. In this way, the evolutionary optimization coarsely identifies the structure of the TS-type FRBSs, while the corresponding neural networks finely tune their parameters. As a result, a set of TS-type FRBSs with different trade-offs between accuracy and complexity is provided at the end of the optimization process. We show the effectiveness of our approach by comparing our results with those obtained on the ocean color inverse problem by other techniques recently proposed in the literature.
Mobile Situation-Aware Task Recommendation Application
Authors: D. Cheng, H. Song, H. Cho, S. Jeong, S. Kalasapur, A. Messer
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

With more and more applications available on mobile devices, it has become increasingly difficult for users to find a desired application. Although research has been conducted for situation-awarere commendations on mobile devices, none addresses this problem; most research is for media content recommendations. Moreover, existing approaches assume predefined situations and/or user-specified profiles; some require users to intentionally train their devices before using them for recommendations. We believe that what defines a situation and what applications are preferred in the situation not only vary from user to user but also change over time, and therefore these assumptions and requirements are impractical for ordinary consumers. In this paper, we will describe our approach of using unsupervised learning, specifically co-clustering, to derive latent situation-based patterns from usage logs of user interactions with the device and environments and use the patterns for task and communication mode recommendations.
Arbitrarily-oriented anisotropic 3D Gaussian filtering computed with 1D convolutions without interpolation
Authors: Vladimír Ulman
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

The paper presents a procedure that allows for good approximation of anisotropic arbitrarily-oriented arbitrarily-dimensional Gaussian filter. Even though the method is generally nD, it is demonstrated and discussed in 3D. It, essentially, substitutes a given 3D Gaussian by six 1D oriented recursive convolutions. Since many such orientations may be available, a set of fast constraints is presented to narrow the number of them and to select the best ones. Firstly, only integer elements are allowed in the directional vector of each orientation not to break translation-invariance of the method. Secondly, validations due to requirements on separability of the approximated filter are applied. Finally, the best directions are selected in the convolution test. We compare the method to a similar recent approach of [Lampert and Wirjadi, 2007] in 3D. A possibility how to improve the performance of bank filtering by using this method is outlined.
On the parity of the Wiener index
Authors: Stephan Wagner, Hua Wang
Venue: European Journal of Combinatorics (2009)

It is a known fact that the Wiener index (i.e. the sum of all distances between pairs of vertices in a graph) of a tree with an odd number of vertices is always even. In this paper, we consider the distribution of the Wiener index and the related tree parameter ''internal path length'' modulo 2 by means of a generating functions approach as well as by constructing bijections for plane trees.
An Algorithm of Adaptive Video Coding Scheme Based on FGS
Authors: Yang Jie, Wang Kecheng, Chen De
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

An improved fine granular adaptive video coding algorithm based on fine granular scalable (FGS) is presented in this paper, which chooses high quality reference in enhancement layer coding, and uses the leaky prediction techniques which can control error propagation by the leaky factor. The simulation and experiments indicate that the proposed scheme can make a better trade-off between the coding efficiency and drift attenuation.
The degree distribution of random k-trees
Authors: Yong Gao
Venue: Theoretical Computer Science (2009)

A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential attachment and copying mechanisms that existing evolving graph processes fail to model due to technical obstacles. The result also serves as a further cautionary note reinforcing the point of view that a power law degree distribution should not be regarded as the only important characteristic of a complex network, as has been previously argued [D. Achlioptas, A. Clauset, D. Kempe, C. Moore, On the bias of traceroute sampling, or power-law degree distribution in regular graphs, in: Proceedings of the 37th ACM Symposium on Theory of Computing, STOC'05, 2005, pp. 694-703; L. Li, D. Alderson, J. Doyle, W. Willinger, Towards a theory of scale-free graphs: Definition, properties, and implications, Internet Mathematics 2 (4) (2005) 431-523; M. Mitzenmacher, The future of power law research, Internet Mathematics, 2 (4) (2005) 525-534].
Inside discrete-event simulation software: how it works and why it matters
Authors: Thomas J. Schriber, Daniel T. Brunner
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper provides simulation practitioners and consumers with a grounding in how discrete-event simulation software works. Topics include discrete-event systems; entities, resources, control elements and operations; simulation runs; entity states; entity lists; and entity-list management. The implementation of these generic ideas in AutoMod, SLX, and Extend is described. The paper concludes with several examples of "why it matters" for modelers to know how their simulation software works, including coverage not only of AutoMod, SLX, and Extend, but also of SIMAN (Arena), ProModel, and GPSS/H.
Health information-seeking and perceptions of website credibility: Examining Web-use orientation, message characteristics, and structural features of websites
Authors: Stephen A. Rains, Carolyn Donnerstein Karmikel
Venue: Computers in Human Behavior (2009)

The study reported here examined perceptions of health website credibility during the process of acquiring health information using the World Wide Web. The relationships between perceptions of website credibility and both message characteristics (e.g., statistics, testimonials) and structural features of health websites (e.g., privacy policy statement, third-party endorsements) were assessed. Additionally, one's Web-use orientation (i.e., searching or surfing) was evaluated as a moderator of the preceding relationships. The results showed a positive relationship between the presence of structural features and perceptions of website credibility as well as a positive relationship between the presence of message characteristics and attitudes about the health topic. Although Web-use orientation moderated the relationship between message characteristics and perceptions of website credibility, the nature of this relationship was inconsistent with study predictions.
Hierarchical Clonal Selection Algorithm for Multistage Pumping Station Optimization Operation Problem
Authors: Fu Duan, Xiaoqin Li, Jietong Peng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper presents a novel approach to solve multistage pumping station optimization operation (MPSOO) problem. The problem is analyzed by two-tier mathematical model using decomposition-coordination method of large-scale system theory, and solved by hierarchical clonal selection algorithm (HCSA). The time priority based mutation operation is employed for considering the impact of peak and valley time-of-use electricity price on optimization operation, whilst the flow-approaching mutation operation is employed in the whole antibody genes to ensure the daily water requirements can be satisfied. These strategies ensure the effectiveness and diversity of mutation and prevent HCSA from the local optimal solution. The comparative experiments demonstrate consistently that HCSA outperforms the existing approach and practical application shows its advantages and feasibility in solving MPSOO problem. HCSA enhances the convergence performance and search efficiency.
HANDFIT: an algorithm for automatic fitting of continuous piecewise regression, with application to feature extraction from remote sensing time series data
Authors: Miguel A. García, Francisco Rodríguez
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

This work presents the algorithm HANDFIT, an iterative method for continuous piecewise regression with automatic change-points estimation. From an initial guess about the number and positions of the change-points or hinges, they are iteratively adjusted by Newton-like displacements, with very fast convergence in most cases. The algorithm allows for sufficiently close hinges to be identified, thus reducing the number of change-points. Examples of applications to feature extraction from remote sensing vegetation indices time series data are presented.
Memory Sharing Approach for TMR Softcore Processor
Authors: Yoshihiro Ichinomiya, Shiro Tanoue, Tomoyuki Ishida, Motoki Amagasaki, Morihiro Kuga, Toshinori Sueyoshi
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

SRAM-based field programmable gate arrays (FPGAs) are more susceptible to single event upsets compared to ASIC. We focus on triple modular redundancy (TMR) to ensure high reliability. Herein, we study the implementation of TMR on a softcore processor called "Base TMR" for considering design flexibility, and evaluate the resource usage and operating frequency. To resolve these problems, we propose two types of TMR designs: "Memory Shared TMR" and "Cache Enabled TMR." Memory Shared TMR achieved efficient memory usage, but it reduced the operating frequency to about 25% in comparison with Base TMR. Cache Enabled TMR improved the operating frequency to a value similar to that of the base processor in exchange for 125% of memory usage overhead. Consequently, when implementing the TMR processor, we need to adopt an adequate TMR design by considering the trade-offs.
Distributed data base processing
Authors: Alyce Jackson
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Distributed Data Processing (i.e., the sharing of computing resources by several processors, each having a specified task to perform; and which may be either centralized or geographically distributed), is one of the more exciting developments since the appearance of the transistor in 1948. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On the cubicity of bipartite graphs
Authors: L. Sunil Chandran, Anita Das, Naveen Sivadasan
Venue: Information Processing Letters (2009)

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R"1xR"2x...xR"k, where each R"i is a closed interval on the real line of the form [a"i,a"i+1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for a graph G, cub(G)=
You Are What You Read
Authors: Philippe Kruchten
Venue: IEEE Software (2009)

Given that useful knowledge in software engineering has a half-life of about five years, reading remains an excellent way to replenish this vanishing resource for the diligent software engineer.
Recording Process Documentation in the Presence of Failures
Authors: Zheng Chen, Luc Moreau
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Scientific and business communities present unprecedented requirements on provenance, where the provenance of some data item is the process that led to that data item. Previous work has conceived a computer-based representation of past executions for determining provenance, termed process documentation, and has developed a protocol, PReP, to record process documentation in service oriented architectures. However, PReP assumes a failure free environment. Failures lead to process documentation unable to be recorded, losing the evidence that a process occurred. This is not acceptable in the applications relying on process documentation and would cause disastrous consequences. This paper describes our solution, F_PReP, a protocol for recording process documentation in the presence of failures. A complete formalisation of the protocol using Abstract State Machines is also presented.
SOA Using AOP for Sensor Web Architecture
Authors: S. V. Patel, Kamlendu Pandey
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Sensor network applications are executed in diverse scenarios, different platforms and in an uncontrolled environment. The data aggregation and then handling the data at the middleware demands an approach to integrate functionalities of various interests from diverse network clusters. So instead of a proprietary solution for individual problems, it is desirable to have a platform independent service oriented architecture. SOA is composed of interactive web services called by client applications. Secured access and use of web services is a primary requirement in these applications. From software engineering point of view, authentication and logging are the cross cutting concerns for the web services. Instead of using conventional object oriented approach for handling concerns in every classs or method, we propose use of Aspect oriented programming paradigm to reduce the code overhead of the system.
Fairness with an Honest Minority and a Rational Majority
Authors: Shien Jin Ong, David C. Parkes, Alon Rosen, Salil Vadhan
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a small minority of honest parties. That is, all parties will learn the secret with high probability when the honest parties follow the protocol and the rational parties act in their own self-interest (as captured by a set-Nash analogue of trembling hand perfect equilibrium). The protocol only requires a standard (synchronous) broadcast channel, tolerates both early stopping and incorrectly computed messages, and only requires 2 rounds of communication.Previous protocols for this problem in the cryptographic or economic models have either required an honest majority, used strong communication channels that enable simultaneous exchange of information, or settled for approximate notions of security/equilibria. They all also required a nonconstant number of rounds of communication.
JDATATRANS for array obfuscation in Java source codes to defeat reverse engineering from decompiled codes
Authors: Praveen Sivadasan, P SojanLal, Naveen Sivadasan
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Software obfuscation or obscuring a software is an approach to defeat the practice of reverse engineering a software for using its functionality illegally in the development of another software. Java applications are more amenable to reverse engineering and re-engineering attacks through methods such as decompilation because Java class files store the program in a semi complied form called 'byte' codes. The existing obfuscation systems obfuscate the Java class files. Obfuscated source code produce obfuscated byte codes and hence two level obfuscation (source code and byte code level) of the program makes it more resilient to reverse engineering attacks. But source code obfuscation is much more difficult due to richer set of programming constructs and the scope of the different variables used in the program and only very little progress has been made on this front. Hence programmers resort to adhoc manual ways of obscuring their program which makes it difficult for its maintenance and usability. To address this issue partially, we developed a user friendly tool JDATATRANS to obfuscate Java source code by obscuring the array usages. Using various array restructuring techniques such as 'array splitting', 'array folding' and 'array flattening', in addition to constant hiding, our system obfuscate the input Java source code and produce an obfuscated Java source code that is functionally equivalent to the input program. We also performed a number of experiments to measure the potency, resilience and cost incurred by our tool.
A theory-based decision heuristic for DPLL(T)
Authors: Dan Goldwasser, Ofer Strichman, Shai Fine
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

We study the decision problem of disjunctive linear arithmetic over the reals from the perspective of computational geometry. We show that traversing the linear arrangement induced by the formula's predicates, rather than the DPLL(T) method of traversing the Boolean space, may have an advantage when the number of variables is smaller than the number of predicates (as it is indeed the case in the standard SMT-Lib benchmarks). We then continue by showing a branching heuristic that is based on approximating T-implications, based on a geometric analysis. We achieve modest improvement in run time comparing to the commonly used heuristic used by competitive solvers.