ppxscal/embedding_network huggingface dataset:
Securing Telehealth Applications in a Web-Based e-Health Portal
Authors: Qian Liu, Shuo Lu, Yuan Hong, Lingyu Wang, Rachida Dssouli
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Telehealth applications can deliver medical services to patients at remote locations using telecommunications technologies, such as the Internet. At the same time, such applications also pose unique security challenges. First, the trust issue becomes more severe due to the lack of visual proofs in telehealth applications. The public key infrastructure (PKI) is insufficient for providing the same kind of trust a patient may attain during a face-to-face service. Second, telehealth services, such as tele-monitoring or tele-consultant, naturally demand a systematic organization of users, roles, resources, and flows of information. Existing access control mechanisms in an e-health system are usually incapable of dealing with such workflow-based services. This paper provides cost-efficient solutions to those issues in the context of a Web-based e-health portal system. First, we propose a PKI-like infrastructure for establishing trust between users using biometrics-based authentication and hierarchies of trust. Second, we develop an access control method for workflow-based telehealth services using a rule-based module already available in the portal system.
Correcting geo-location interpolation errors in NESDIS-produced AVHRR 1b data near the Poles
Authors: J. Sullivan, A. Jelenak
Venue: International Journal of Remote Sensing (2007)

Researchers using AVHRR level 1b data produced by NESDIS Operations interpolate most geo-located pixels. Each scanline has count values for either 409 GAC or 2048 LAC pixels, but geo-locations at only 51 anchor pixels. Quadratic interpolation separately in longitude and latitude is commonly used to estimate the missing geo-locations. This is accurate, except for latitudes poleward of 86° N or 86° S. Interpolation errors can be 15 km near the poles, compared with 0.3 km at 40° N. Rapidly converging lines of longitude near the poles cause the problem. The Gnomonic map projection is an accurate representation of the Earth near a pole. The strategy-(1) convert the anchor pixel coordinates from (long, lat) to Gnomonic, (2) interpolate in the Gnomonic coordinates, and (3) convert the interpolated locations back to (long,lat) coordinates-reduces interpolation errors to 0.5 km, even near the poles.
A testbed for secure and robust SCADA systems
Authors: Annarita Giani, Gabor Karsai, Tanya Roosta, Aakash Shah, Bruno Sinopoli, Jon Wiley
Venue: ACM SIGBED Review (2008)

The Supervisory Control and Data Acquisition System (SCADA) monitor and control real-time systems. SCADA systems are the backbone of the critical infrastructure, and any compromise in their security can have grave consequences. Therefore, there is a need to have a SCADA testbed for checking vulnerabilities and validating security solutions. In this paper we develop such a SCADA testbed.
A unified architecture for natural language processing: deep neural networks with multitask learning
Authors: Ronan Collobert, Jason Weston
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and semantically) using a language model. The entire network is trained jointly on all these tasks using weight-sharing, an instance of multitask learning. All the tasks use labeled data except the language model which is learnt from unlabeled text and represents a novel form of semi-supervised learning for the shared tasks. We show how both multitask learning and semi-supervised learning improve the generalization of the shared tasks, resulting in state-of-the-art-performance.
Network design for vertex connectivity
Authors: Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We study the survivable network design problem (SNDP) for vertex connectivity. Given a graph G(V,E) with costs on edges, the goal of SNDP is to find a minimum cost subset of edges that ensures a given set of pairwise vertex connectivity requirements. When all connectivity requirements are between a special vertex, called the source, and vertices in a subset T ⊆ V, called terminals, the problem is called the single-source SNDP. Our main result is a randomized kO(k2) log4n-approximation algorithm for single-source SNDP where k denotes the largest connectivity requirement for any source-terminal pair. In particular, we get a poly-logarithmic approximation for any constant k. Prior to our work, no non-trivial approximation guarantees were known for this problem for any k ≥ 3. We also show that SNDP is kΩ(1)-hard to approximate and provide an elementary construction that shows that the well-studied set-pair linear programming relaxation for this problem has an Ω(k1/3) integrality gap.
Peer-to-Peer Application in Mobile Cellular Systems
Authors: Shuping Liu, Jianwei Chen, Shushan Zhao, Fan Na
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

A novel mobile peer-to-peer (MP2P) in cellular networks is presented in this paper. The proposed architecture is based on Session Initiation Protocol (SIP) that is part of the IP Multimedia Subsystem (IMS) in the third-generation mobile cellular networks. In this architecture, P2P control messages are transported in SIP messages, so called P2PoverSIP. By way of SIP, the operators can have control on security, group management, mobility and chargeability. We describe the target architecture for IMS network. The performance of the architecture is analyzed mathematically and simulated by programming.
Multilingual OCR system for South Indian scripts and English documents: An approach based on Fourier transform and principal component analysis
Authors: V. N. Manjunath Aradhya, G. Hemantha Kumar, S. Noushath
Venue: Engineering Applications of Artificial Intelligence (2008)

Character recognition lies at the core of the discipline of pattern recognition where the aim is to represent a sequence of characters taken from an alphabet [Kasturi, R., Gorman, L.O., Govindaraju, V., 2002. Document image analysis: a primer. Sadhana 27 (Part 1), 3-22]. Though many kinds of features have been developed and their test performances on standard database have been reported, there is still room to improve the recognition rate by developing improved features. In this paper, we present a multilingual character recognition system for printed South Indian scripts (Kannada, Telugu, Tamil and Malayalam) and English documents. South Indian languages are most popular languages in India and around the world. The proposed multilingual character recognition is based on Fourier transform and principal component analysis (PCA), which are two commonly used techniques of image processing and recognition. PCA and Fourier transforms are classical feature extraction and data representation techniques widely used in the area of pattern recognition and computer vision. Our experimental results show the good performance over the data sets considered.
Engineering of IT ecosystems: design of ultra-large-scale software-intensive systems
Authors: Sebastian Herold, Holger Klus, Dirk Niebuhr, Andreas Rausch
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

Ultra-Large-Scale Systems are considered to be the new system generation. For these systems current development approaches are not well suited, since they do not scale well for large systems. One view onto such systems is to see them as IT Ecosystems comparable to complex ecosystems from nature and biology. We will present an example for such a system, the smart city. Furthermore, we will present challenges that arise from engineering and operating IT Ecosystems.
Performance Evaluation of Trust Management in Pervasive Computing
Authors: Tao Sun, Mieso K. Denko
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In pervasive computing, interactions are possible among users, devices and applications anytime and anywhere. Security and privacy are critical issues in this environment because pervasive computing environments' decentralized and distributed nature means that classical, centralized security management mechanisms are not directly applicable. Pervasive computing's similarity to human society makes trust an effective solution to handle security and privacy problems in pervasive computing environments In this paper we present a specific framework for implementing the distributed trust scheme based on our previous work. This work is inspired by a study on security and privacy requirements in a pervasive computing environment's actual applications. We have evaluated the performance using simulation experiments with performance metrics of throughput, packet loss ratio and message overhead. The results demonstrate the proposed approach's usefulness.
Reasoning about inherent parallelism in modern object-oriented languages
Authors: Wayne Reid, Wayne Kelly, Andrew Craik
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply relying on processor cycles getting faster. Programmers will, therefore, need to accept some of the burden of detecting and exploiting application level parallelism because automatic parallelization is still far from a reality. On the one hand we need to fundamentally reconsider how we express algorithms as the languages we currently use were never designed to make reasoning about parallelism easy. On the other hand, to be widely adopted, any new programming approach will need to be only incrementally different to current paradigms. This paper attempts to find that difficult balance. It extends modern object-oriented programming techniques with a new abstraction that allows either programmers or automatic parallelizing compilers to reason about inherent data parallelism.
Intelligent Multimedia Recommender by Integrating Annotation and Association Mining
Authors: Vincent S. Tseng, Ja-Hwung Su, Bo-Wen Wang, Chin-Yuan Hsiao, Jay Huang, Hsin-Ho Yeh
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Making a decision among a set of items from compound and complex information has been becoming a difficult task for common users. Collaborative filtering has been the mainstay of automatically personalized search employed in contemporary recommender systems. Until now, it is still a challenging issue to reduce the gap between user perception and multimedia contents. To bridge user's interests and multimedia items, in this paper, we present an intelligent multimedia recommender system by integrating annotation and association mining techniques. In our proposed system, low-level multimedia contents are conceptualized to support rule-based collaborative filtering recommendation by automated annotation. From the discovered relations between user contents and conceptualized multimedia contents, the proposed recommender system can provide a suitable recommendation list to assist users in making a decision among a massive amount of items.
Generic model for revenue maximization
Authors: Antti Niemi, Jyrki Joutsensalo, Timo Hämäläinen
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper introduces a model that can be used to share link capacity among customers under different kind of traffic conditions. This model is suitable for different kind of networks like the 4G networks (fast wireless access to wired network) to support connections of given duration that requires a certain quality of service. We study different types of network traffic mixed in a same communication link. A single link is considered as a bottleneck and the goal is to find customer traffic profiles that maximizes the revenue of the link. Presented allocation system accepts every calls and there is not absolute blocking, but the offered data rate/user depends on the network load. Data arrival rate depends on the current link utilization, user's payment (selected CoS class) and delay. The arrival rate is (i) increasing with respect to the offered data rate, (ii) decreasing with respect to the price, (iii) decreasing with respect to the network load, and (iv) decreasing with respect to the delay. As an example, explicit formula obeying these conditions is given and analyzed.
Strong barrier coverage of wireless sensor networks
Authors: Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipulla
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to detect intruders moving along restricted crossing paths in rectangular areas. We present a complete solution to this problem for sensors that are distributed according to a Poisson point process. In particular, we present an efficient distributed algorithm to construct sensor barriers on long strip areas of irregular shape without any constraint on crossing paths. Our approach is as follows: We first show that in a rectangular area of width w and length l with w = Ω(log l), if the sensor density reaches a certain value, then there exist, with high probability, multiple disjoint sensor barriers across the entire length of the area such that intruders cannot cross the area undetected. On the other hand, if w = o(log l), then with high probability there is a crossing path not covered by any sensor regardless of the sensor density. We then devise, based on this result, an efficient distributed algorithm to construct multiple disjoint barriers in a large sensor network to cover a long boundary area of an irregular shape. Our algorithm approximates the area by dividing it into horizontal rectangular segments interleaved by vertical thin strips. Each segment and vertical strip independently computes the barriers in its own area. Constructing "horizontal" barriers in each segment connected by "vertical" barriers in neighboring vertical strips, we achieve continuous barrier coverage for the whole region. Our approach significantly reduces delay, communication overhead, and computation costs compared to centralized approaches. Finally, we implement our algorithm and carry out a number of experiments to demonstrate the effectiveness of constructing barrier coverage.
Topic based language models for OCR correction
Authors: Anurag Bhardwaj, Faisal Farooq, Huaigu Cao, Venu Govindaraju
Venue: Proceedings of the second workshop on Analytics for noisy unstructured text data (2008)

Despite several decades of research in document analysis, recognition of unconstrained handwritten documents is still considered a challenging task. Previous research in this area has shown that word recognizers produce reasonably clean output when used with a restricted lexicon. But in absence of such a restricted lexicon, the output of an unconstrained handwritten word recognizer is noisy. The objective of this research is to process noisy recognizer output and eliminate spurious recognition choices using a topic based language model. We construct a topic based language model for every document using a training data which is manually categorized. A topic categorization sub-system based on Maximum Entropy model is also trained which is used to generate the topic distribution of a test document. A given test word image is processed by the recognizer and its word recognition likelihood is refined by incorporating topic distribution of the document and topic based language model probability. The proposed method is evaluated on a publicly available IAM dataset and experimental results show significant improvement in the word recognition accuracy from 32% to 40% over a test set consisting of 4033 word images extracted from 70 handwritten document images.
Debugging: the good, the bad, and the quirky -- a qualitative analysis of novices' strategies
Authors: Laurie Murphy, Gary Lewandowski, Renée McCauley, Beth Simon, Lynda Thomas, Carol Zander
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

A qualitative analysis of debugging strategies of novice Java programmers is presented. The study involved 21 CS2 students from seven universities in the U.S. and U.K. Subjects "warmed up" by coding a solution to a typical introductory problem. This was followed by an exercise debugging a syntactically correct version with logic errors. Many novices found and fixed bugs using strategies such as tracing, commenting out code, diagnostic print statements and methodical testing. Some competently used online resources and debuggers. Students also used pattern matching to detect errors in code that "just didn't look right". However, some used few strategies, applied them ineffectively, or engaged in other unproductive behaviors. This led to poor performance, frustration for some, and occasionally the introduction of new bugs. Pedagogical implications and suggestions for future research are discussed.
A classical normal integral revisited
Authors: Saralees Nadarajah
Venue: Digital Signal Processing (2008)

An explicit expression is derived for a classical integral that is frequently encountered in the electrical and electronic engineering literature. The expression involves a well-known special function. The application of the result is described to three specific problems in the literature.
A Time Slotted Model for All-Optical Variable-Length Packet Switching without Packet Alignment
Authors: Soung Yue Liew, Andrew Khin Huat Tan, Elok Robert Tee
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper studies an all-optical slot-switching model that is able to accommodate variable-length optical packets without the necessity for packet alignment. This is called the variable-length-packet fixed-length-slot (VPFS) switching scheme. In a VPFS network, all switches adopt the same slot size but slot boundaries are not synchronized from one switch to another. When a packet of any length arrives at a switch, a slot or multiple consecutive slots must be assigned to carry that packet from the input to the destined output, with the condition that the chain of slots carrying the packet cannot be broken up and routed separately in the switch. Given a selected slot size, s, and the average length of packet, , we show that the expected arrival overhead of a packet due to asynchronous slot boundary is equal to s, thus the maximum throughput of the VPFS scheme is limited to /( +s). Although a small slot size is preferable in order to maximize the throughput, the challenge of switching is a compromise. The proposed model can be used for evaluating the performances of different variable-length optical packet switching scenarios.
XML query optimization in the presence of side effects
Authors: Giorgio Ghelli, Nicola Onose, Kristoffer Rose, Jerome Simeon
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra for the W3C XML query language with operations that allow data to be immediately updated. We study the impact of that extension on logical optimization, join detection, and pipelining. The main result of this work is to show that, with proper care, a number of important optimizations based on nested relational algebras remain applicable in the presence of side effects. Our approach relies on an analysis of the conditions that must be checked in order for algebraic rewritings to hold. An implementation and experimental results demonstrate the effectiveness of the approach.
Efficient Method for Content Extraction Applied in Multimedia Communication
Authors: Ionut Pirnog, Mihnea Udrea, Constantin Paleologu
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper we present the multimedia content extraction method based on region and object segmentation. The process of content extraction represents one step in solving the problem of content adaptation. Adaptation means the preparation and delivery of content that matches the resources of the connected terminal or network in an optimal way. The process of multimedia content extraction consists of two stages: semantic video modeling and video segmentation. The result of semantic video modeling is the representation of raw data in a more structured form, and it is essential in the following stage. Video segmentation means the partition of an image into a set of non overlapping homogenous regions whose union is the entire image. The presented segmentation methods are edge-based, region-based and motion-based, and are used for moving or static object detection.
Reconfigurable Depth Buffer Compression Design for 3D Graphics System
Authors: Tzung-Rung Jung, Lan-Da Van, Wai-Chi Fang, Teng-Yao Sheu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Depth buffer bandwidth reduction is one of the most important issues in bandwidth-limited 3D computer graphics system. In this paper, we propose a reconfigurable algorithm for depth buffer compression. For 8x8 tile size and 16-bit depth values, the proposed algorithm can achieve 1.91:1 compression ratio on average and improve 76.9% and 39.4% compared with HA [12] and DDPCM [7], respectively. Furthermore, the devised algorithm supports one-plane and two-plane compression modes and manipulates break points more efficiently.
Development of an integrated hardware and software platform for the rapid detection of cerebral aneurysm rupture
Authors: Prashant R. Bhadri, Suresh A. Kumar, Vasant A. Salgaonkar, Fred R. Beyette,  Jr., Joseph F. Clark
Venue: Analog Integrated Circuits and Signal Processing (2008)

A cerebral aneurysm is defined as a weakened portion of an artery in the brain. Rupture of a cerebral aneurysm leads to subarachnoid hemorrhage (SAH). A significant number of patients with SAH are initially misdiagnosed and subjected to the risks associated with aneurysm re-rupture. Traditional detection methods recommended by physicians include computed tomography (CT) scan, lumbar puncture and angiography. Unfortunately, the CT scan is ineffective after 12 h, and angiography is best suited for those cases of finding the aneurysm before surgery. Physicians may therefore rely on lumbar puncture to develop a quick and objective evaluation by assessing xanthochromia. Bilirubin in the cerebrospinal fluid, resulting from the chemical decomposition of whole blood, is an indicator of hemorrhage. This metabolite can be detected after lumbar puncture, by differentiating its optical signature in the spinal fluid. In cases of traumatic spinal tap, bilirubin needs to be distinguished from whole blood. We introduce a diagnostic system based on visible spectroscopy to quickly and objectively assess low blood-volume SAH. The system integrates innovative hardware and a powerful software interface. We explore an algorithm that accounts for the noise and distortion from blood in the cerebrospinal fluid. We introduce a portable, user-friendly hardware platform composed of specific components designed for their sensitivity and specificity.