ppxscal/embedding_network huggingface dataset:
Electron beam lithography of HSQ/PMMA bilayer resists for negative tone lift-off process
Authors: Haifang Yang, Aizi Jin, Qiang Luo, Junjie Li, Changzhi Gu, Zheng Cui
Venue: Microelectronic Engineering (2008)

A HSQ/PMMA bilayer resist system, in which HSQ as negative tone electron beam resist top layer and PMMA as bottom layer, has been investigated for negative tone lift-off process. Patterns are first defined on the HSQ resist using electron beam lithography, and then transferred into the bottom PMMA layer using oxygen reactive ion etching. Electron beam exposure of HSQ on top of PMMA layer has been characterised, showing the PMMA underlayer has no effect on the exposure of HSQ. Optimum conditions for reactive ion etching of PMMA underlayer have been established. The undercut length in the PMMA layer is found near linearly dependence on etching time. Well defined undercut profile has been achieved in the HSQ/PMMA bilayer resist system, and good negative tone metal lift-off structures have been successfully produced.
Coupled system of Korteweg-de Vries equations type in domains with moving boundaries
Authors: Eleni Bisognin, Vanilde Bisognin, Mauricio Sepúlveda, Octavio Vera
Venue: Journal of Computational and Applied Mathematics (2008)

We consider the initial-boundary value problem in a bounded domain with moving boundaries and nonhomogeneous boundary conditions for the coupled system of equations of Korteweg-de Vries (KdV)-type modelling strong interactions between internal solitary waves. Finite domains of wave propagation changing in time arise naturally in certain practical situations when the equations are used as a model for waves and a numerical scheme is needed. We prove a global existence and uniqueness for strong solutions for the coupled system of equations of KdV-type as well as the exponential decay of small solutions in asymptotically cylindrical domains. Finally, we present a numerical scheme based on semi-implicit finite differences and we give some examples to show the numerical effect of the moving boundaries for this kind of systems.
Technical Section: Evaluation of HDR tone mapping methods using essential perceptual attributes
Authors: Martin adík, Michael Wimmer, Laszlo Neumann, Alessandro Artusi
Venue: Computers and Graphics (2008)

The problem of reproducing high dynamic range images on media with restricted dynamic range has gained a lot of interest in the computer graphics community. There exist various approaches to this issue, which span several research areas including computer graphics, image processing, color vision, physiological aspects, etc. These approaches assume a thorough knowledge of both the objective and subjective attributes of an image. However, no comprehensive overview and analysis of such attributes has been published so far. In this contribution, we present an overview about the effects of basic image attributes in high dynamic range tone mapping. Furthermore, we propose a scheme of relationships between these attributes, leading to the definition of an overall image quality measure. We present results of subjective psychophysical experiments that we have performed to prove the proposed relationship scheme. Moreover, we also present an evaluation of existing tone mapping methods (operators) with regard to these attributes. Finally, the execution of with reference and without a real reference perceptual experiments gave us the opportunity to relate the obtained subjective results. Our effort is not just useful to get into the tone mapping field or when implementing a tone mapping method, but it also sets the stage for well-founded quality comparisons between tone mapping methods. By providing good definitions of the different attributes, user-driven or fully automatic comparisons are made possible.
A manufactured solution for a two-dimensional steady wall-bounded incompressible turbulent flow
Authors: L. Eça, M. Hoekstra, A. Hay, D. Pelletier
Venue: International Journal of Computational Fluid Dynamics (2007)

This paper presents a manufactured solution (MS), resembling a two-dimensional, steady, wall-bounded, incompressible, turbulent flow for RANS codes verification. The specified flow field satisfies mass conservation, but requires additional source terms in the momentum equations. To also allow verification of the correct implementation of the turbulence models transport equations, the proposed MS exhibits most features of a true near-wall turbulent flow. The model is suited for testing six eddy-viscosity turbulence models: the one-equation models of Spalart and Allmaras and Menter; the standard two-equation k-ε model and the low-Reynolds version proposed by Chien; the TNT and BSL versions of the k-ω model.
TPSF+C: A Two-Phase On-Demand Scatternet Formation Algorithm Considering Route Stability
Authors: Cheng-Zen Yang, Chun-Ta Lin, I-Hsuan Huang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Recently Bluetooth scatternet formation obtains much research attention. Besides proactive and reactive formation schemes, several hybrid schemes have been proposed to enjoy benefits of both proactive and reactive schemes. In this paper, we propose an enhancement based on a previous hybrid scheme TPSF+. The proposed TPSF+C scheme considers both node living time and connectivity to construct a more stable on-demand scatternet. The simulation results show that TPSF+C has lower reconstruction overhead than TPSF+.
Abstracts and Fragments
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2008)

Cover artist Tim Borgmann discusses striking a balance between creating abstract art and working as a professional illustrator and animator.
Annulling SYN Flooding Attacks with Whitelist
Authors: Tae Hyung Kim, Young-Sik Choi, Jong Kim, Sung Je Hong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

SYN flooding is one of classical Denial of Service (DoS) attacks abusing the TCP 3-way handshake process. This attack causes a server not to accept additional connection requests by filling the server's backlog queue with malicious connection requests (SYN packets). Although several methods have been proposed to solve the SYN Flooding attack, they cannot guarantee reliable connection establishments to clients under extremely aggressive SYN flooding attacks. In this paper, we propose a WhiteList-based defense scheme that increases connection success ratio of legitimate connection requests under SYN flooding attacks. We implemented this scheme as a linux kernel module. Experimental results show that the proposed method ensures high connection success ratio for legitimate clients and effectively annuls bogus SYN flooding.
Microsoft Outlook 2007 Calendar, Contacts, Tasks Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use calendar, contacts, and tasks features of Microsoft Office Outlook 2007. Topics include: Calendar: Setting up Your Work Week, Viewing the Calendar, Creating Appointments, Repeating Appointments or Meetings, Creating and Scheduling a Meeting, Responding to Meeting Requests, Changing Time or Date of Meeting/Appointment, Viewing Multiple Calendars, Creating and Using Group Schedules, Printing the Calendar, Hiding/Displaying Tasks, Contacts: Creating & Editing Contacts, Sending a Mail Message to a Contact, Searching for Contacts, Merging Contacts with Word, Viewing Mail Related to a Contact, Tasks: Displaying To-Do and Task List Folders, Creating Tasks, Marking Complete, Adding Messages or Contacts to the To-Do List, Sorting Tasks, Changing Task Order, Assigning Tasks, Viewing Tasks in the Calendar, Hiding /Displaying Tasks in the To-Do Bar, Printing Tasks, For Any Outlook Item: Deleting, Assigning an Item to a Category, Sorting on Categories, Sharing Calendar Contacts Tasks or Notes, Using Another Person's Calendar Contacts Tasks or Notes Folder, and The Reading Pane. Also includes a list of Keyboard and Selection Shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Computer Simulation Framework for Flatfish Aquaculture
Authors: Heetaek Ceong, Kyehwa Park, Sungju Jung
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We propose the simulation framework that is a software framework for minimizing the effort of accessing integrated information from sensing data within aquaculture monitoring system. Simulation framework is composed by filtering and data integration module, state modeling module, data analysis module, data maintenance module, and visualization module.
Full functional verification of linked data structures
Authors: Karen Zee, Viktor Kuncak, Martin Rinard
Venue: ACM SIGPLAN Notices (2008)

We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables. Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data structure implementations (with the exception of properties involving execution time and/or memory consumption). Given that the desired correctness properties include intractable constructs such as quantifiers, transitive closure, and lambda abstraction, it is a challenge to successfully prove the generated verification conditions. Our Jahob verification system uses integrated reasoning to split each verification condition into a conjunction of simpler subformulas, then apply a diverse collection of specialized decision procedures, first-order theorem provers, and, in the worst case, interactive theorem provers to prove each subformula. Techniques such as replacing complex subformulas with stronger but simpler alternatives, exploiting structure inherently present in the verification conditions, and, when necessary, inserting verified lemmas and proof hints into the imperative source code make it possible to seamlessly integrate all of the specialized decision procedures and theorem provers into a single powerful integrated reasoning system. By appropriately applying multiple proof techniques to discharge different subformulas, this reasoning system can effectively prove the complex and challenging verification conditions that arise in this context.
Denoising and analysis of surface EMG signals
Authors: M. S. Hussain, M. B. I. Reaz, F. Mohd-Yasin, M. K. Khaw
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

In this research, surface electromyography (SEMG) signal analysis from the right rectus femoris muscle is performed during walk. Wavelet transform (WT) has been applied for removing noise from the surface SEMG. Gaussianity tests are conducted to understand changes in muscle contraction and to quantify the effectiveness of the noise removal process. Results show that the proposed method can effectively remove noise from the raw SEMG signals for further analysis.
Discovering social services in pervasive environments with privacy
Authors: Sonia Ben-Mokhtar, Pierre-Guillaume Raverdy, Roberto Speicys Cardoso, Aitor Urbieta, Nikolaos Georgantas
Venue: Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion (2007)

Social networks enable users with similar interests to find each other and collaborate in social activities. Pervasive social networks benefit from pervasive technologies to enable the creation of communities where members are physically close to each other, supporting additional possibilities of collaboration and interaction. Modeling social network applications using service-oriented architectures (SOAs) can help to overcome environment heterogeneity, reduce the coupling between clients and service providers and improve flexibility of service advertisement and discovery.
Distributed optimal contention window control for elastic traffic in single-cell wireless LANs
Authors: Yaling Yang, Jun Wang, Robin Kravets
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

This paper presents a theoretical study on distributed contention window control algorithms for achieving arbitrary bandwidth allocation policies and efficient channel utilization. By modeling different bandwidth allocation policies as an optimal contention window assignment problem, we design a general and fully distributed contention window control algorithm, called General Contention window Adaptation (GCA), and prove that it converges to the solution of the contention window assignment problem. By examining the stability of GCA, we identify the optimal stable point that maximizes channel utilization and provide solutions to control the stable point near the optimal point. Due to the generality of GCA, our work provides a theoretical foundation to analyze existing and design new contention window control algorithms.
Using Random Perturbation Method to Improve Efficacy Prediction of siRNA Sequences
Authors: Willard Frutiger, Jeremy Collins, Wei Hu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Short interfering RNAs (siRNAs) can be used to silence gene expression. The potential application of this research opens the door for the development of the future generations of effective drugs. The question ofhow to design effective siRNAs is still under intense study. Our motivation is to improve the accuracy of the simple linear model. We propose a new random perturbation method that predicts most actives iRNA candidates with high accuracy. The contribution of this paper is two-fold. First, we developed the random perturbation method which improved the prediction of siRNA sequence efficacy. Our method is easy to implement and runs efficiently. Second, we developed a new method; we named it alpha method that can linearly optimize different contributions from different weight sets.
Functional test selection based on unsupervised support vector analysis
Authors: Onur Guzey, Li-C. Wang, Jeremy Levitt, Harry Foster
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Extensive software-based simulation continues to be the mainstream methodology for functional verification of designs. To optimize the use of limited simulation resources, coverage metrics are essential to guide the development of effective test suites. Traditional coverage metrics are defined based on either a functional model or a structural model of the design. If our goal is to select a subset of tests from a set of tests, using these coverage metrics require simulation of the entire set before the effectiveness of tests can be compared. In this paper, we propose a novel methodology that estimates the input space covered by a set of tests. We use unsupervised support vector analysis to learn such a space, resulting in a subset of tests that represent the original set of tests. A direct application of this methodology is to select tests before simulation in order to reduce simulation cycles. Consequently, simulation effectiveness can be improved. Experimental results based on application of the proposed methodology to the OpenSparc T1 processor are reported to demonstrate the practicality of our approach.
Ontology construction and concept reuse with formal concept analysis for improved web document retrieval
Authors: W. C. Cho, D. Richards
Venue: Web Intelligence and Agent Systems (2007)

The World Wide Web (WWW) has become the most popular place to collect information. However the exponential growth in the size of the WWW makes it difficult for people to find what they are looking for. Even though about 85% of engines often do not return information found to be relevant to the user. The main focus of this paper is to improve search performance by reusing keywords and Web pages which have been previously used or visited by other users. The Formal Concept Analysis (FCA) method has been adapted to maintain a concept map for the reuse of knowledge. This paper shows that both precision and recall have been improved when the technique was employed by users sharing the same knowledge in a specific-domain area.
Wireless Patient Information Provision and Sharing at the Point of Care using a Virtual Organization Framework in Clinical Work
Authors: Mohyuddin, W.A.Gray, Hazel Bailey, Carol Jordan, David Morrey
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The paper presents a Virtual Organization (VO) framework which incorporates wireless technology support at the point of care in a clinical environment. It reflects a move to patient centric healthcare provided by multi-disciplinary care teams working in an integrated way for patient care. The work highlights the importance of wireless technologies for addressing point of care issues faced by care team members. It describes VO and Computer Supported Cooperative Work (CSCW) aspects in the clinical environment and analyzes existing virtual and collaborative infrastructures in the healthcare literature. In the light of current problem analysis, it proposes the approach of Patient Centric Virtual Organizations (PCVOs) development in the clinical environment. PCVOs provide improved provision and sharing of patient information at the point of care which leads to enhanced collaborative working patterns for the care team members. In a comprehensive way, it discusses the study results and focuses on the development, implementation and evaluation strategy for the pilot prototype of case study conducted at a local NHS Cancer Centre for possible improvements in patient care infrastructure.
A Novel Topic Extraction Method Based on Bursts in Video Streams
Authors: Kimiaki Shirahama, Kuniaki Uehara
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In this paper, we introduce a novel topic extraction method. Firstly, we divide a video into events based on target character's appearance and disappearance. Specifically, each event is an interval where the target character performs a certain action. And, it is characterized by a specific pattern of shots where the character appears and shots where he/she disappears. Then, we define a "topic'' as an event where the target character performs an interesting action (e.g. fight, chase, kiss and so on). We extract such topics as events containing abnormal patterns, called "bursts''. The experiments on different videos validate that character's appearance and disappearance are effective for obtaining semantically meaningful events. From these events, we could extract many interesting topics.
Preference-based decision making for personalised access to Learning Resources
Authors: Charalampos Karagiannidis, George Lekakos, Athanasios V. Vasilakos
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

This article addresses the selection of Learning Resources (LRs; learning material, learning activities, etc.) through a preference-based decision-making framework. We consider the case where a set of LRs are maintained within a digital repository and are described in a common format (e.g. through learning technologies specifications and standards). We present a preference-based decision-making framework for selecting among these LRs according to the profile of each individual learner, thus facilitating personalised access to LRs. We argue that the proposed framework overcomes some of the problems caused by the rule-based approaches which are usually employed to facilitate adaptation and personalisation, in general.
Comparative Study of Wireless Network Simulators
Authors: Johannes Lessmann, Peter Janacik, Lazar Lachev, Dalimir Orfanus
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In order to evaluate the behavior and performance of protocols for wireless networks, simulations are a good compromise between cost and complexity, on the one hand, and accuracy of the results, on the other hand. Since there are many simulators for wireless networks, it is often difficult to decide which simulator to choose. To help shed light on this issue, we present a case study in which four popular wireless network simulators were used to evaluate a well-known topology control protocol (SPAN). Within the case study, we describe outstanding and desirable but missing features of the simulators, outlining their strengths and weaknesses. Further, we compare the amount of effort needed for installation, familiarization, implementation (needed lines of code and lines for configuration) and visualization. As opposed to other simulator comparisons, we do not focus on the correlation of the individual simulation results, but try to compare the simulators from feature and usability point of view. This paper can help other researchers to quickly identify which simulator is most suitable for their needs.
Detecting and Handling Unreliable Points for Camera Parameter Estimation
Authors: Yihong Wu, Youfu Li, Zhanyi Hu
Venue: International Journal of Computer Vision (2008)

The popularly used DLT method sometimes fails to give reliable camera parameter estimation. It is therefore important to detect the unreliability and provide the corresponding solutions. Based on a complete framework of invariance for six points, we construct two evaluation functions to detect the unreliability. The two evaluation functions do not involve any computations for the camera projective matrix or optical center and thus are efficient to perform the detection. Then, the guidelines corresponding to the different detection results are presented. In particular, a filtering RANSAC method to remove the detected unreliable points is provided. The filtering RANSAC proves to be successful in removing the unreliable points even if these points are of a large proportion.
Functionally linear decomposition and synthesis of logic circuits for FPGAs
Authors: Tomasz S. Czajkowski, Stephen D. Brown
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

This paper presents a novel logic synthesis method to reduce the area of XOR-based logic functions. The idea behind the synthesis method is to exploit linear dependency between logic sub-functions to create an implementation based on an XOR relationship with a lower area overhead. Experiments conducted on a set of 99 MCNC benchmark (25 XOR based, 74 non-XOR) circuits show that this approach provides an average of 18.8% area reduction as compared to BDS-PGA 2.0 and 25% area reduction as compared to ABC for XOR-based logic circuits.
Distributed packing in planar graphs
Authors: Andrzej Czygrinow, Michal Hańckowiak, Wojciech Wawrzyniak
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

We give an efficient distributed algorithm that finds an almost optimal packing of a graph H in a planar graph G. The algorithm is deterministic and its running time is poly-logarithmic in the order of G.
Structured design of interactive VR applications
Authors: Krzysztof Walczak
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

A novel approach to structured design of complex interactive virtual reality applications, called Flex-VR, is presented. Two main elements of the approach are: first, componentization of VR content, which enables to dynamically compose interactive behavior-rich virtual scenes from independent components, and second, a high-level VR content model, which enables users to easily create and manipulate complex VR application content.