ppxscal/embedding_network huggingface dataset:
Cloaking locations for anonymous location based services: a hybrid approach
Authors: Chengyang Zhang, Yan Huang
Venue: Geoinformatica (2009)

An important privacy issue in Location Based Services is to hide a user's identity while still provide quality location based services. Previous work has addressed the problem of locational $\mathcal{K}$ -anonymity either based on centralized or decentralized schemes. However, a centralized scheme relies on an anonymizing server (AS) for location cloaking, which may become the performance bottleneck when there are large number of clients. More importantly, holding information in a centralized place is more vulnerable to malicious attacks. A decentralized scheme depends on peer communication to cloak locations and is more scalable. However, it may pose too much computation and communication overhead to the clients. The service fulfillment rate may also be unsatisfied especially when there are not enough peers nearby. This paper proposes a new hybrid framework called HiSC that balances the load between the AS and mobile clients. HiSC partitions the space into base cells and a mobile client claims a surrounding area consisting of base cells. The number of mobile clients in the surrounding cells is kept and updated at both client and AS sides. A mobile client can either request cloaking service from the centralized AS or use a peer-to-peer approach for spatial cloaking based on personalized privacy, response time, and service quality requirements. HiSC can elegantly distribute the work load between the AS and the mobile clients by tuning one system parameter base cell size and two client parameters - surrounding cell size and tolerance count. By integrating salient features of two schemes, HiSC successfully preserves query anonymity and provides more scalable and consistent service. Both the AS and the clients can enjoy much less work load. Additionally, we propose a simple yet effective random range shifting algorithm to prevent possible privacy leakage that would exist in the original P2P approach. Our experiments show that HiSC can elegantly balance the work load based on privacy requirements and client distribution. HiSC provides close to optimal service quality. Meanwhile, it reduces the response time by more than an order of magnitude from both the P2P scheme and the centralized scheme when anonymity level(value of $\mathcal{K}$ ) or number of clients is large. It also reduces the update message cost of the AS by nearly 6 times and the peer searching message cost of the clients by more than an order of magnitude.
Back to the Future: An Historical Perspective on the Pendulum-Like Changes in Literacy
Authors: Oren Soffer, Yoram Eshet-Alkalai
Venue: Minds and Machines (2009)

This article focuses on the pendulum-like change in the way people read and use text, which was triggered by the introduction of new reading and writing technologies in human history. The paper argues that textual features, which characterized the ancient pre-print writing culture, disappeared with the establishment of the modern-day print culture and has been "revived" in the digital post-modern era. This claim is based on the analysis of four cases which demonstrate this textual-pendulum swing: (1) The swing from concrete iconic-graphic representation of letters and words in the ancient alphabet to abstract phonetic representation of text in modern eras, and from written abstract computer commands "back" to the concrete iconic representation in graphic user interfaces of the digital era; (2) The swing from scroll reading in the pre-print era to page or book reading in the print era and "back" to scroll reading in the digital era; (3) The swing from a low level of authorship in the pre-print era to a strong authorship perception in the print era, and "back" to a low degree of authorship in the digital era; (4) The swing from synchronic representation of text in both visual and audio formats during the pre-print era to a visual representation only in print, and "back" to a synchronic representation in many environments of the digital era. We suggest that the print culture, which is usually considered the natural and preferred textual environment, should be regarded as the exception.
A Joint Matrix Factorization Approach to Unsupervised Action Categorization
Authors: Peng Cui, Fei Wang, Li-Feng Sun, Shi-Qiang Yang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In this paper, a novel unsupervised approach to mining categories from action video sequences is presented. This approach consists of two modules: action representation and learning model. Videos are regarded as spatially distributed dynamic pixel time series, which are quantized into pixel prototypes. After replacing the pixel time eries with their corresponding prototype labels, the video sequences are compressed into 2D action matrices. We put these matrices together to form an multi-action tensor, and propose the joint matrix factorization method to simultaneously cluster the pixel prototypes into pixel signatures, and matrices into action classes. The approach is tested on public and popular Weizmann data set, and promising results are achieved.
Feature selection with dynamic mutual information
Authors: Huawen Liu, Jigui Sun, Lei Liu, Huijie Zhang
Venue: Pattern Recognition (2009)

Feature selection plays an important role in data mining and pattern recognition, especially for large scale data. During past years, various metrics have been proposed to measure the relevance between different features. Since mutual information is nonlinear and can effectively represent the dependencies of features, it is one of widely used measurements in feature selection. Just owing to these, many promising feature selection algorithms based on mutual information with different parameters have been developed. In this paper, at first a general criterion function about mutual information in feature selector is introduced, which can bring most information measurements in previous algorithms together. In traditional selectors, mutual information is estimated on the whole sampling space. This, however, cannot exactly represent the relevance among features. To cope with this problem, the second purpose of this paper is to propose a new feature selection algorithm based on dynamic mutual information, which is only estimated on unlabeled instances. To verify the effectiveness of our method, several experiments are carried out on sixteen UCI datasets using four typical classifiers. The experimental results indicate that our algorithm achieved better results than other methods in most cases.
Comparison of La-based high-k dielectrics: HfLaSiON and HfLaON
Authors: Won-Ho Choi, In-Shik Han, Hyuk-Min Kwon, Tae-Gyu Goo, Min-Ki Na, Ook-Sang Yoo, Ga-Won Lee, Chang Yong Kang, Rino Choi, Seung Chul Song, Byoung Hun Lee, Raj Jammy, Yoon-Ha Jeong, Hi-Deok Lee
Venue: Microelectronic Engineering (2009)

For the first time, we present a comparative study on HfLaSiON and HfLaON gate dielectric with an equivalent oxide thickness (EOT) of 0.8nm (T"i"n"v=1.2nm). A detailed DC analysis of I"o"n vs. I"o"f"f shows HfLaON performs somewhat better than HfLaSiON. However, positive bias temperature instability (PBTI) lifetime of HfLaSiON is higher than HfLaON by about 2 orders of magnitude. On the other hand, hot carrier stress lifetime for HfLaSiON was similar to that of HfLaON. From the activation energy and U-trap, we found that the cause of different threshold voltage (V"T) shifts under PBT stress and detrapping was originated from stable electron traps induced by different charge trapping rates.
Gossiping by processors prone to omission failures
Authors: Dariusz R. Kowalski, Michał Strojnowski
Venue: Information Processing Letters (2009)

We consider the gossip problem in a synchronous message-passing system. Participating processors are prone to omission failures, that is, a faulty processor may fail to send or receive a message. The gossip problem in the fault-tolerant setting is defined as follows: every correct processor must learn the initial value of any other processor, unless the other one is faulty; in the latter case either the initial value or the information about the fault must be learned. We develop two efficient algorithms that solve the gossip problem in time O(logn), where n is the number of processors in the system. The first one is an explicit algorithm (i.e., constructed in polynomial time) sending O(nlogn+f^2) messages, and the second one reduces the message complexity to O(n+f^2), where f is the upper bound on the number of faulty processors.
Applying eMM in a 3D Approach to e-Learning Quality Improvement
Authors: Kattiya Tawsopar, Kittima Mekhabunchakij
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Abstract—The E-Learning Maturity Model (eMM) is a framework for quality improvement, by which institutions can assess and compare their capability to sustainably develop, deploy and support e-learning. This paper presents a three-dimensional (3D) approach to e-Learning quality improvement. In the approach the eMM is applied in “Diagnosis” phase as an assessment tool for e-Learning process improvement in institutional context where the key elements necessary for improvement in e-learning activities are identified. The “Development” phase of the 3D approach concentrates on putting together improvement or change packages to target areas of deficiency. In strategic point of views, the packages are translated into implementation plans in a short term, a mid term, and a long term. In “Delivery” phase of the approach, the main focus is the human resource and marketing efforts for implementing the change packages in operational point of views. The 3D approach described can be beneficial in guiding individual institution's understanding of their e-learning capability and providing educational institutions with a roadmap for e-learning process improvement as well as providing a framework for strategic and operational planning and investment.
Challenges at 45nm and beyond
Authors: Dan Bailey, Eric Soenen, Puneet Gupta, Paul Villarrubia, Sang Dhong
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Design at 45nm technologies and below is a risky proposition because of the many design challenges involved: variability, leakage, verification complexity, poor analog device performance, etc. In this panel, experienced designers coming from different backgrounds talk about how they have overcome some of the design and CAD challenges in 45nm, what CAD challenges still exist and how the CAD community can help.
10 GHz wavelength tunable active mode-locked fiber ring laser based on semiconductor optical amplifier
Authors: Shuangyi Yan, Jian-Guo Zhang, Wei Zhao
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A 10GHz Semiconductor optical amplifier (SOA) based active mode-locked fiber ring laser with a forward injection optical pulse sequence is demonstrated with a wide wavelength tunable span in this paper. The laser can generate pulse sequence with pulsewidth around 12ps without any external pulse compression and high output power up to 10.75dBm at 10GHz stably. Incorporated with a tunable optical bandpass filter, about 35nm wavelength tunable span is achieved. A detailed experimental analysis is done about the influences of the characteristics of external pulse sequences and some key factors of the cavity on the pulsewidth of the output pulse sequence.
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Authors: Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núòez-Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao
Venue: Computational Geometry: Theory and Applications (2009)

We give a systematic study of Hamiltonicity of grids - the graphs induced by finite subsets of vertices of the tilings of the plane with congruent regular convex polygons (triangles, squares, or hexagons). Summarizing and extending existing classification of the usual, ''square'', grids, we give a comprehensive taxonomy of the grid graphs. For many classes of grid graphs we resolve the computational complexity of the Hamiltonian cycle problem. For graphs for which there exists a polynomial-time algorithm we give efficient algorithms to find a Hamiltonian cycle. We also establish, for any g>=6, a one-to-one correspondence between Hamiltonian cycles in planar bipartite maximum-degree-3 graphs and Hamiltonian cycles in the class C"g of girth-g planar maximum-degree-3 graphs. As applications of the correspondence, we show that for graphs in C"g the Hamiltonian cycle problem is NP-complete and that for any N>=5 there exist graphs in C"g that have exactly N Hamiltonian cycles. We also prove that for the graphs in C"g, a Chinese Postman tour gives a (1+8g)-approximation to TSP, improving thereby the Christofides ratio when g>16. We show further that, in any graph, the tour obtained by Christofides' algorithm is not longer than a Chinese Postman tour.
Semantic Access to a Database of Images: An Approach to Object-Related Image Retrieval
Authors: Aleix Martinez, Joan R. Serra
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Image retrieval has commonly been attempted using non-semantic approaches. It is clear though, that semantic retrieval is more desirable because it facilitates the user's task. In this paper, we present a new approach to semantic access of a database of images by asking for the presence of certain objects; this is known as object-related image retrieval.This approach is built within a classical computer vision framework (i.e. localization, segmentation and identification). This platform is used to automatically index images of a given database by object names, which finally allows the use of semantics (driven by these object names) to extract images from the database (e.g. "all those images that have a bull and Melissa's face").The use of a totally automatic system would cause some errors of indexing (and so retrieval). To solve this we use a human-in-the-loop strategy where a human expert is placed after the two outputs of the system to confirm their "correctness". An experimental result using a database of 1,300 images is presented.
A Principle Component Analysis Based Method on Evaluating Wireless Mobile Ad Hoc Network Routing Protocols
Authors: Panlong Yang, Guangcheng Qin, Chang Tian, Guihai Chen
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this paper, we study the performance evaluation method applying Principle Component Analysis (PCA) theory. Due to the self-organizing and distributed character, each metric has its representative character evaluation method. Metrics while considering various network scenarios reflect different aspects of routing protocol efficiency in mobile ad hoc network. By now, there isn’t any ad hoc routing protocol can outperform others in any network conditions. Principle Component Analysis method is successfully applied in analyzing different impact of routing metric on network overall performance. Considering the suggestions in RFC 2501, PCA method tackle the performance evaluation problem as different types of metrics may lead to confusing evaluation results. It proves to be reliable and rational. Statistical results provided by PCA show that different types of routing protocol, such as proactive routing and reactive routing, has different principle components and routing metrics will have different impact on them. A synthetic method in evaluating metric representing the overall performance of the network is proposed after the PCA procedure, and routing performance comparison could clearly and reasonably be done with it.
A neurally plausible model of the dynamics of motion integration in smooth eye pursuit based on recursive Bayesian estimation
Authors: Kameliya Dimova, Michael Denham
Venue: Biological Cybernetics (2009)

In this study, we describe a model of motion integration in smooth eye pursuit based on a recursive Bayesian estimation process, which displays a dynamic behaviour qualitatively similar to the dynamics of the motion integration process observed experimentally, both psychophysically in humans and monkeys, and physiologically in monkeys. By formulating the model as an approximate version of a Kalman filter algorithm, we have been able to show that it can be put into a neurally plausible, distributed recurrent form which coarsely corresponds to the recurrent circuitry of visual cortical areas V1 and MT. The model thus provides further support for the notion that the motion integration process is based on a form of Bayesian estimation, as has been suggested by many psychophysical studies, and moreover suggests that the observed dynamic properties of this process are the result of the recursive nature of the motion estimation.
IT non-conformity in institutional environments: E-marketplace adoption in the government sector
Authors: Craig Standing, Ian Sims, Peter Love
Venue: Information and Management (2009)

Institutional authority is a factor that impacts adoption of IT. Institutional theory incorporates three different but complimentary perspectives and we used these to develop a layered analysis of IT adoption in organizations. We used a case study of State Government agencies in Australia to show how layers of authority influenced the adoption or rejection of technology and that such forces varied in their influence over time. Based on this, we proposed the notion of patterns of conformity and non-conformity which recognise the changes in levels of compliance over time as organizational forces arise. In particular, the alignment of layers of authority acts to ensure conformity with or rejection of IT adoption decisions.
Multiagent Evolutionary Algorithm for T-coloring Problem
Authors: Jing Liu, Weicai Zhong, Jinshu Li
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

With the properties of T-coloring problems in mind, multiagent systems and evolutionary algorithms are integrated to form a new algorithm, Multiagent Evolutionary Algorithm for T-coloring (MAEA-T-coloring). We studied the generalization of classical graph coloring model, and focused our interest in the restricted T-coloring. An agent in MAEA-T-coloring represents a candidate solution to T-colorings. All agents live in a latticelike environment, with each agent fixed on a lattice-point. In order to increase energies, they compete or cooperate with their neighbors using their knowledge. Experiments on large random instances of T-colorings show encouraging results about MAEA- T-coloring.
Light Weight MP3 Watermarking Method for Mobile Terminals
Authors: Koichi Takagi, Shigeyuki Sakazawa, Yasuhiro Takishima
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes a novel MP3 watermarking method which is applicable to a mobile terminal with limited computational resources. Considering that in most cases the embedded information is copyright information or metadata, which should be extracted before playing back audio contents, the watermark detection process should be executed at high speed. However, when conventional methods are used with a mobile terminal, it takes a considerable amount of time to detect a digital watermark. This paper focuses on scalefactor manipulation to enable high speed watermark embedding/detection for MP3 audio and also proposes the manipulation method which minimizes audio quality degradation adaptively. Evaluation tests showed that the proposed method is capable of embedding 3 bits/frame information without degrading audio quality and detecting it at very high speed. Finally, this paper describes application examples for authentication with a digital signature.
A new system architecture for crowd simulation
Authors: M. Lozano, P. Morillo, J. M. Orduña, V. Cavero, G. Vigueras
Venue: Journal of Network and Computer Applications (2009)

Crowd simulation requires both rendering visually plausible images and managing the behavior of autonomous agents. Therefore, these applications need an efficient design that allows them to simultaneously handle these two requirements. Although several proposals have focused on the software architectures for these systems, no proposals have focused on the computer systems supporting them. In this paper, we analyze the computer architectures used in the literature to support distributed virtual environments. Also, we propose a distributed computer architecture which is efficient enough to support simulations of thousand of autonomous agents. This proposal consists of a cluster of interconnected computers in order to improve flexibility and robustness, as well as a hierarchical software architecture that efficiently provides consistency. Performance evaluation results show that the trade-off between flexibility and consistency allows to efficiently manage thousands of autonomous agents. Therefore, this network-based system architecture can provide the required scalability for large-scale crowd simulations.
Performance Analysis of Hierarchical Mobile IPv6: Does it Improve Mobile IPv6 in Terms of Handover Speed?
Authors: Youn-Hee Han, Sung-Gi Min
Venue: Wireless Personal Communications: An International Journal (2009)

There has been a rapid growth in the need to support mobile nodes in IPv6-based networks. IETF has completed to standardize Mobile IPv6 (MIPv6) and Hierarchical Mobile IPv6 (HMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that HMIPv6 generally improves MIPv6 in terms of handover speed, they do not carefully consider the details of the whole handover procedures. In this paper, based on the current IETF standards of both MIPv6 and HMIPv6, we conduct a comprehensive study of all IP-level handover procedures: movement detection, duplicate address detection, and location registration. Based on this study, we provide a mathematical analysis on MIPv6 and HMIPv6 performance in terms of handover speed. From the analysis, we reveal that the average HMIPv6 handover latency is not always lower than the average MIPv6 handover latency. Furthermore, even the intra-domain handover latency of HMIPv6 is not reduced much compared with MIPv6 handover latency. A finding of our analysis is that optimization techniques for movement detection and duplicate address detection are essential to shortening HMIPv6 handover latency and increasing the benefit of HMIPv6.
Genetic Synthesis of Software Architecture
Authors: Outi Räihä, Kai Koskimies, Erkki Mäkinen
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Design of software architecture is intellectually one of the most demanding tasks in software engineering. This paper proposes an approach to automatically synthesize software architecture using genetic algorithms. The technique applies architectural patterns for mutations and quality metrics for evaluation, producing a proposal for a software architecture on the basis of functional requirements given as a graph of functional responsibilities. Two quality attributes, modifiability and efficiency, are considered. The behavior of the genetic synthesis process is analyzed with respect to quality improve ment speed, the effect of dynamic mutation, and the effect of quality attribute prioritization. Our tests show that it is possible to genetically synthesize architectures that achieve a high fitness value early on.