ppxscal/embedding_network huggingface dataset:
Privacy and Identity Management
Authors: Marit Hansen, Ari Schwartz, Alissa Cooper
Venue: IEEE Security and Privacy (2008)

When developing an identity management system, designers must consider the system's purpose and particular privacy needs. A set of guidelines and advice can help them make these determinations.
Halvers and expanders (switching)
Authors: M. Ajtai
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors investigate the asymptotic efficiency of certain combinatorial networks called halvers, which are basic building blocks of many parallel algorithms. They improve the efficiency of halvers in terms of their depth. The novelty is the use of combinatorial circuits whose basic units are k-sorter switches.
Universal semantic communication I
Authors: Brendan Juba, Madhu Sudan
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant in the context of modern computational infrastructures where an increase in the diversity of computers is making the task of inter-computer interaction increasingly burdensome. Computers spend a substantial amount of time updating their software to increase their knowledge of other computing devices. In turn, for any pair of communicating devices, one has to design software that enables the two to talk to each other. Is it possible instead to let the two computing entities use their intelligence (universality as computers) to learn each others' behavior and attain a common understanding? What is 'common understanding?' We explore this question in this paper. To formalize this problem, we suggest that one should study the 'goal of communication:' why are the two entities interacting with each other, and what do they hope to gain by it? We propose that by considering this question explicitly, one can make progress on the question of universal communication. We start by considering a computational setting for the problem where the goal of one of the interacting players is to gain some computational wisdom from the other player. We show that if the second player is "sufficiently" helpful and powerful, then the first player can gain significant computational power (deciding PSPACE complete languages). Our work highlights some of the definitional issues underlying the task of formalizing universal communication, but also suggests some interesting phenomena and highlights potential tools that may be used for such communication.
Fast Communication: On the relationship of non-parametric methods for coherence function estimation
Authors: Chengshi Zheng, Mingyuan Zhou, Xiaodong Li
Venue: Signal Processing (2008)

In this paper, several seemingly disparate non-parametric magnitude squared coherence (MSC) estimation methods, including Welch's averaged periodogram, the minimum variance distortionless response (MVDR), and the canonical correlation analysis (CCA) methods, are treated in a unified way, which makes it simpler to understand the methods and their properties. This uncovered relationship also brings out a new class of MSC estimators in terms of non-linear functions of the covariance matrix.
Some exact Wick type stochastic generalized Boussinesq equation solutions
Authors: Frédéric Ginovart
Venue: Journal of Computational and Applied Mathematics (2008)

The resolution of the stochastic generalized Boussinesq equation driven by a white noise is undertaken. Explicit solutions are found thanks to a white noise functional approach and the F-expansion method. Among these solutions, periodic and solitonic ones are pointed out.
Data reduction approach for sensitive associative classification rule hiding
Authors: Juggapong Natwichai, Xingzhi Sun, Xue Li
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

When a business unit shares data with another unit, there could be some sensitive patterns which should not be disclosed. In order to remove or "hide" a sensitive pattern in data sharing scenario, the data set needs to be modified such that the sensitive pattern becomes uninteresting according to the pre-specified "interestingness" threshold (s). However, data quality of the given data set should also be maintained, otherwise, the sharing will be meaningless. Existing data modification algorithms usually use data perturbation approach, i.e. changing some data values in a given data set from an original value to another value. Though, it could hide sensitive patterns and maintain data quality, such the approach could not be applied in a situation where real data are required. In this paper, we explore an alternate approach for sensitive pattern hiding problem, data reduction, i.e. removing the whole selected tuples. By data reduction, every tuple in modified data sets is real data without any change. The focused pattern type is associative classification rule. The impact on data quality is denoted as the numbers of false-dropped rules and ghost rules. The experiments are conducted to evaluate the approach and the results have shown that data reduction approach can produce data sets with high data quality, thus it is applicable to the problem.
AtomRace: data race and atomicity violation detector and healer
Authors: Zdeněk Letko, Tomáš Vojnar, Bohuslav Křena
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

The paper proposes a novel algorithm called AtomRace for a dynamic detection of data races. Data races are detected as a special case of atomicity violations on atomic sections specially defined to span just particular read/write instructions and the transfer of control to and from them. A key ingredient allowing AtomRace to efficiently detect races on such short atomic sections is a use of techniques for a careful injection of noise into the scheduling of the monitored programs. The approach is very simple, fully automated, avoids false alarms, and allows for a lower overhead and better scalability than many other existing dynamic data race detection algorithms. We illustrate these facts by a set of experiments with a prototype implementation of AtomRace. Further, AtomRace can also be applied to detect atomicity violations on more general atomic sections than those used for the data race detection. They can be defined by the user or obtained by some static analysis.
Distributed Transmission Power Control for Wireless Sensor Networks
Authors: Xiao Liang, Wei Li, T. Aaron Gulliver
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In wireless networks, transmission power control (TPC) can save energy and decrease transmission latency. Due to the characteristics of wireless sensor networks (WSNs), the TPC has to be distributed, which presents a significant design challenge. We propose a simple distributed approach to TPC in this paper, and evaluate its performance.
Grouping and optimization of XPath expressions in DB2® pureXML
Authors: Andrey Balmin, Fatma Özcan, Ashutosh Singh, Edison Ting
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Several XML DBMSs support XQuery and/or SQL/XML languages, which are based on navigational primitives in the form of XPath expressions. Typically, these systems either model each XPath step as a separate query plan operator, or employ holistic approaches that can evaluate multiple steps of a single XPath expression. There have also been proposals to execute as many XPath expressions as possible within a single FLWOR block simultaneously in a data streaming context. We observe that blindly combining all possible XPath expressions for concurrent execution can result in significant performance degradation in a database system. We identify two main problems with this strategy. First, the simple strategy of grouping all XPath expressions on a single document does not always work if the query involves more than one data source or has nested query blocks. Second, merging XPath expressions may result in unnecessary execution of branches that can be filtered by predicates in other branches or elsewhere in the query. To rectify these problems, IBM® DB2® pureXML" adopts a combination of heuristic-based rewrite transformations, to decide which XPath expressions should be grouped for concurrent evaluation, and cost-based optimization to globally order the groups within the query execution plan, and locally order the branches within individual groups. Experimental evaluation confirms that selectively grouping multiple XPath expressions allows for better query evaluation performance and reduces the query optimization complexity. These optimization techniques have been implemented as part of IBM DB2 9.5 (pureXML).
Unifying Human and Software Services in Web-Scale Collaborations
Authors: Daniel Schall, Hong-Linh Truong, Schahram Dustdar
Venue: IEEE Internet Computing (2008)

As collaborative Web-based platforms evolve into service-oriented architectures, they promote composite and user-enriched services. In such platforms, the collaborations typically involve both humans and software services, thus creating highly dynamic and complex interactions. However, today's collaboration tools don't let humans specify different interaction interfaces (services), which can be reused in various collaborations. Furthermore, humans need more ways to indicate their availability and desire to participate in collaborations. The Human-Provided Services (HPS) framework lets people manage their interactions and seamlessly integrate their capabilities into Web-scale workflows as services. It unifies humans and software services and supports ad hoc and process-centric collaborations.
An exploratory model of knowledge flow barriers within healthcare organizations
Authors: Chinho Lin, Bertram Tan, Shofang Chang
Venue: Information and Management (2008)

Healthcare today is mainly knowledge-based and the diffusion of medical knowledge is imperative for proper treatment of patients. Our study of the industry explored barriers to knowledge flow using a Cultural Historical Activity Theory framework. Our work was exploratory and qualitative in nature, and consisted of three phases: in-depth interviews to explore medical knowledge flow barriers resulting in a model; a case study using a survey approach to test and modify the model; and a Delphi study to validate the generalizability of the model. We concluded that knowledge flow experienced five barriers: knowledge source, knowledge receiver, knowledge transfer, knowledge flow context, and the organizational context. Furthermore, these were correlated.
MARVIN: a medical research application framework based on open source software
Authors: Tobias Rudolph, Marc Puls, Christoph Anderegg, Lars Ebert, Martina Broehan, Adrian Rudin, Jens Kowal
Venue: Computer Methods and Programs in Biomedicine (2008)

This paper describes the open source framework MARVIN for rapid application development in the field of biomedical and clinical research. MARVIN applications consist of modules that can be plugged together in order to provide the functionality required for a specific experimental scenario. Application modules work on a common patient database that is used to store and organize medical data as well as derived data. MARVIN provides a flexible input/output system with support for many file formats including DICOM, various 2D image formats and surface mesh data. Furthermore, it implements an advanced visualization system and interfaces to a wide range of 3D tracking hardware. Since it uses only highly portable libraries, MARVIN applications run on Unix/Linux, Mac OS X and Microsoft Windows.
Mobility label based network: Mobility support in label switched networks with multi-protocol BGP
Authors: Oleg Berzin
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

To support mobility the network control plane is required to detect changes in the mobile node's location and distribute the new location information throughout the network thus enabling the forwarding plane to deliver traffic in an optimal manner. The network responsiveness to the mobile node movements can be generally thought of as the time elapsed between the moment the node's location in the network has changed and the moment the reception of packets in the new location has resumed. This paper outlines an approach to handling the user mobility at the network layer in the context of multi-protocol label switched networks (MPLS). This new approach does not rely on the existing IP mobility management protocols such as Mobile IP and is instead based on the combination of multi-protocol BGP (MP-BGP) and MPLS. This paper proposes to introduce new protocol elements to MP-BGP to achieve mobility label distribution at the network control plane and the optimal packet delivery to the mobile node by the network forwarding plane using MPLS regardless of the IP protocol addressing and the associated logical network topology.
Observations of ice surface temperature and thickness in the Baltic Sea
Authors: M. Leppäranta, J. E. Lewis
Venue: International Journal of Remote Sensing (2007)

This paper presents the results of an airborne thermal infrared (TIR) experiment. The data were obtained during 6-9 February 1992 period in the Bay of Bothnia, the northern section of the Baltic Sea, in connection with an ERS-1 field campaign. Two Aegema model 880 TIR cameras were used with nominal wavelengths at 5 and 10 µm, attached to the front of the helicopter with a Tyler mount. The camera's thermal resolution is 0.2 K; after corrections for atmosphere effects, the surface temperature accuracy is 0.5 K. The spatial resolution of individual images is 70 cm at the 300-m flight altitude. The measurement programme was successful, producing high-quality TIR data over ice for two different days, even under difficult weather conditions. Ice temperatures ranged from open water temperatures to 261 K for fast ice conditions on the day on the first flight. The standard deviation of the surface temperature, generally, increased with ice thickness with a value of ∼0.4 K for maximum thickness, and autocorrelation length scales not exceeding a value of 5 m. Generally, all the higher values of standard deviation (>0.7) of surface temperatures were for scenes with mixed ice/open water. The results show that TIR has a substantial ability to classify ice type and thickness when the air temperature is less than 269 K, from open water at the freezing point to thin nilas and thicknesses up to 20-45 cm in the fast ice zone. In addition, a quasi-steady sea-ice model is used to provide a physical interpretation of the sea-ice surface temperatures. The use of the model requires information on the atmospheric surface layer and snow thickness data, together with calibration points. The model worked well when the air temperature was around 260 K or less.
A new system to acquire and restore document shape and content
Authors: George V. Landon, W. Brent Seales, Duncan Clarke
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

We have developed a system that can acquire and restore not only a distorted single-page document, but also more complicated multilayer film negatives. In this work, we demonstrate a new image-based document acquisition system, based on single-scatter diffuse transmission, that captures the intrinsic intensity information and shape distortion of documents. Using a simple to build and costeffective camera and LCD system, the data is acquired to allow for automatic photometric and geometric correction of most documents. We show the results of our system with single sheet nonplanar documents. Furthermore, to show the robustness of this system, we demonstrate the restoration on safety acetate film negatives over 70 years old that have been damaged due to shrinkage and other forms of deterioration.
Using Incremental Mining to Generate Fuzzy Rules for Real-Time Network Intrusion Detection Systems
Authors: Ming-Yang Su, Sheng-Cheng Yeh, Kai-Chi Chang, Hua-Fu Wei
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In the paper, we propose a fast algorithm to generate fuzzy association rules by incremental mining approach, for which the transactions or data records are online instantly collected from live packets. That is, as one data record is collected online, the latest fuzzy rules can be obtained immediately. According to our simulation, in case of the number of features do not excess twenty, mining process can be completed from several milliseconds to seconds depending on the number of features.
An Ontology-Based Knowledge System for Supporting Position and Classification of Co-Branding Strategy
Authors: Wei-Lun Chang
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

As many companies seek growth through the development of new products, co-branding strategy provides a way to develop new products. However, combining two brands may cause brand meaning to transfer in ways that were never intended. Utilizing two or more brand names in the process of introducing new products offers competitive advantages. The present paper advances research on co-branding strategies by proposing a knowledge management system for co-branding through an ontology with three concepts: co-branding aim, category, and effect. The ontology-based knowledge system not only provides a roadmap of co-branding strategies but also illuminates issues related to co-branding for related research.
News aware volatility forecasting: is the content of news important?
Authors: Calum S. Robertson, Shlomo Geva, Rodney C. Wolff
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

The efficient market hypothesis states that the market incorporates all available information to provide an accurate valuation of the asset at any given time. However, most models for forecasting the return or volatility of assets completely disregard the arrival of asset specific news (i.e., news which is directly relevant to the asset). In this paper we propose a simple adaptation to the GARCH model to make the model aware of news. We propose that the content of news is important and therefore describe a methodology to classify asset specific news based on the content. We present evidence from the US, UK and Australian markets which show that this model improves high frequency volatility forecasts. This is most evident for news which has been classified based on the content. We conclude that it is not enough to know when news is released, it is necessary to interpret its content.
A Video Sharing Platform with Data Grid Technology for Mobile Devices
Authors: Chao-Tung Yang, Chun-Jen Chen, Chien-Jung Huang, Hung-Yen Chen
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Increases in mobile device processing power, storage capacity, and connectivity have led to a rapid rise in mobile device use. But it is due to wireless network limit, unstable characteristic and restricted storage space, so mobile users face challenges in establishing connections with other users for sharing video files. To address this issue, we propose an architecture that uses GridFTP protocol to establish a video sharing platform for mobile devices, combined with a data grid to help analyze and classify videos. We hope our system be a convenient sharing video way in wireless network, and promote more people use wireless devices.
M-learning for applied science M-LAS
Authors: Carole Salis, Fabrizio Murgia, Andrea Mameli
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

With a simple mobile phone, an object which every young person is nowadays equipped with, we may think to approach the users to knowledge remaining in the most natural environment while learner may find himself in a situation in which he can autonomously choose and consult according to his time and place preferences. The access to knowledge content through one's own mobile phone may truly obviate the problem of motivation and may be exploited to transmit innovative content about science. We are developing an experimental system for applied science learning content students will may explore through flas1h animation and comics on their mobile. This experimentation will be proposed to all students who visit CRS4 with their teachers.
Detecting energy-greedy anomalies and mobile malware variants
Authors: Hahnsang Kim, Joshua Smith, Kang G. Shin
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the limited battery-lifetime of these devices restricts their portability and applicability, and this weakness can be exacerbated by mobile malware targeting depletion of battery energy. Such malware are usually difficult to detect and prevent, and frequent outbreaks of new malware variants also reduce the effectiveness of commonly-seen signature-based detection. To alleviate these problems, we propose a power-aware malware-detection framework that monitors, detects, and analyzes previously unknown energy-depletion threats. The framework is composed of (1) a power monitor which collects power samples and builds a power consumption history from the collected samples, and (2) a data analyzer which generates a power signature from the constructed history. To generate a power signature, simple and effective noise-filtering and data-compression are applied, thus reducing the detection overhead. Similarities between power signatures are measured by the χ2-distance, reducing both false-positive and false-negative detection rates. According to our experimental results on an HP iPAQ running a Windows Mobile OS, the proposed framework achieves significant (up to 95%) storage-savings without losing the detection accuracy, and a 99% true-positive rate in classifying mobile malware.
Leveraging Biologically-inspired Mobile Agents Supporting Composite Needs of Reliability and Timeliness in Sensor Applications
Authors: Pruet Boonma, Qi Han, Junichi Suzuki
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Wireless sensor networks are often used for event detection applications, which require a certain level of reliability and timeliness while minimizing energy consumption. Existing work considers reliability, timeliness and energy consumption largely in isolation. This paper proposes a solution to satisfy these conflicting requirements by using biologically-inspired mobile agents. The problem is formulated into an NP-hard problem, the Vehicle Routing Problem, and decentralized and centralized heuristics are developed to govern agent behaviors. Simulation results show that proposed solution allows agents (i.e., sensor applications) to effectively balance the tradeoffs among reliability, timeliness and energy efficiency and outperform an existing similar mechanism.
A multidimensional bisection method for unconstrained minimization problem
Authors: E. Y. Morozova
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does not require a differentiability of function, and is guaranteed to converge to the minimizer for the class of strictly unimodal functions. The computational results demonstrating an effectiveness of algorithm for minimizing nonsmooth functions are presented.