ppxscal/embedding_network huggingface dataset:
Computer access devices for severly motor-disability using bio-potentials
Authors: Sung-Jae Jung, Nam-Euk Her, Il-Hwan Kim
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper, we describe implementation of a computer access device for severly motor-disability. Those who are totally paralyzed, or "locked-in" cannot use conventional augmentative technologies, all of which require some measure of muscle control. The forehead is often the last site to suffer degradation in cases of severe disability and degenerative disease. We uses brain and body forehead bio-potentials in a novel way to generate multiple signals for computer control inputs. A bio-amplifier within this device separates the forehead signal into three frequency channels. The lowest channel is responsive to bio-potentials resulting from eye motion, and second channel is band pass derived between 0.5 and 45Hz, falling within the accepted Electroencephalographic(EEG) range. A digital processing station subdivides this region into eleven components frequency bands using FFT algorithm. The third channel is defined as an Electromyographic(EMG) signal. It responds to contractions of facial muscles and is well suited to discrete on/off switch closures, keyboard commands. We confirmed the performance and availability of the developed system with experimental user's bio-potentials.
Synthesis of Local Controller Programs for Enforcing Global Security Properties
Authors: Fabio Martinelli, Ilaria Matteucci
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper we present a framework based on contexts theory and logic to study how, given a partially specified system, i.e., a system in which there are some unspecified\unknown components, i.e., potential attackers, it is possible to enforce a global security property by controlling all the unspecified parts of the given system. We propose two methods to control them: A centralized method, in which there is a unique controller program that controls all the unspecified components, and a decentralized one in which each unspecified component is monitored by a controller program that forces it to behave correctly, i.e., according to a local requirement found by a reduction of the global one. In both cases we show how to synthesize controller programs that solve the problem.
Effect of plasma treatments on interface adhesion between SiOCH ultra-low-k film and SiCN etch stop layer
Authors: Hung-Chun Tsai, Yee-Shyi Chang, Shou-Yi Chang
Venue: Microelectronic Engineering (2008)

The effect of different plasma treatments on the interfacial bonding configurations and adhesion strengths between porous SiOCH ultra-low-dielectric-constant film and SiCN etch stop layer have been investigated in this study. From X-ray photoelectron spectroscopic analyses, interlayer regions of about 10nm thick with complicated mixing bonds were found at SiOCH/SiCN interfaces. With plasma treatments, especially H"2/NH"3 two-step plasma, a carbon-depletion region of about 30nm thick with more Si-O related bonds of high binding energy formed at the interface. Furthermore, the adhesion strengths of the SiOCH/SiCN interfaces were measured by nanoscratch and microscratch tests. For the untreated interface, the adhesion energy was obtained as about 0.22 and 0.44J/m^2 by nanoscratch and microscratch tests, respectively. After plasma treatments, especially the H"2/NH"3 treatment, the interfacial adhesion energy was effectively improved to 0.41 and 0.89J/m^2 because more Si-O bonds of high binding energy formed at the interfaces.
Transports of delight? What the experience of receiving (mobile) phone calls can tell us about design
Authors: Ann Light
Venue: Personal and Ubiquitous Computing (2008)

This paper takes a phenomenological approach to analysing people's accounts of receiving phone calls, drawing on Heidegger and Feenberg. Accounts of calls received on a mobile phone are compared with those on landlines, charting progress from location-centred to person-centred phoning. A range of naturally-occurring contexts are discussed in terms of the experience of balancing the activities of talking on the phone with activities in the immediate environment, and the enchantment sustained or sacrificed. The study suggests that recipients' enchantment with phoning is affected by their freedom and desire to project towards the caller and create shared spaces, and reveals some factors that impact on the transitions of attention required to do so. It concludes with the design implications of taking this view of interactions with and through phones.
A study on the improved performances of OLED using CMP process parameters determined by DOE method
Authors: Yong-Jin Seo, Gwon-Woo Choi, Woo-Sun Lee
Venue: Microelectronic Engineering (2008)

In order to study the chemical-mechanical polishing (CMP) characteristics of indium-tin oxide (ITO) thin film with a sufficient removal amount and a good planarity, the optimal CMP process conditions were determined by using a design of experiment (DOE) approach. The electrical and optical properties, such as current-voltage (I-V) curve and photoluminescence spectrum, were discussed in order to evaluate the possibility of the CMP application for an organic light emitting diode (OLED) device using an ITO film. The electrical I-V characteristics and optical properties of ITO thin film were improved after the CMP process using optimized process conditions compared to that of as-deposited thin film before the CMP process.
User Modelling in a Collaborative Learning Environment for UML
Authors: Kalliopi Tourtoglou, Maria Virvou
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we describe AUTO-COLLEAGUE that is an adaptive and collaborative learning environment for UML. There are two kinds of user: the trainer and the trainee. The trainees can design UML diagrams given by the trainer or run certain tests/exercises for specific problems that are given. They can collaborate with each other. The system offers them adaptive help and advice regarding the most effective and productive organization of the trainees in groups. This is done so that the users’ collaboration among them can be more efficient. The adaptivity is achieved through user modelling based on stereotypes. The stereotypes are related to three aspects of the performance of the trainee: the Level of Expertise, the Performance Types and the Personality.
Analyzing and Modeling Open Source Software Bug Report Data
Authors: Fengzhong Zou, Joseph Davis
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

We analyzed the major differences between closed and open source software development from a software reliability perspective. We examined real world bug report data from six open source software projects, as well as the relationship between the release cycles and the stability characteristics of the bug report data of open source software projects. We then modeled the bug report data using nonparametric techniques. The experimental results suggest that generalized additive models and exponential smoothing approaches are suitable for the estimation of software reliability at least for some of the open source projects.
First Person Shooter Multiplayer Game Traffic Analysis
Authors: Qili Zhou, Colin James Miller, Victor Bassilious
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Internet delay is important for FPS games because it can determine who wins or loses a game. Network traffic for such games has been analysed using packet size and inter-packet time metrics fitting a statistical model. However, the effect of other network traffic on game traffic was not investigated or considered. This paper explores the traffic generated by an FPS game, taking into account the effects of other Internet traffic. Experiments were conducted in an isolated local network, repeated across the Internet and in a simulator with varying degrees of background traffic. FPS game packet inter-arrival time distribution was observed to spread with the decrease of bandwidth due to other traffic along network paths. The twin peak characteristic of packet inter-arrival time observed in the isolated local network experiment flattens and spreads to a bell-shape as bandwidth decreases due to the increased and non-unique delay of packet arrivals.
On the Partial-Terminal Steiner Tree Problem
Authors: Sun-Yuan Hsieh, Wen-Hao Pi
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Given a complete graph G = (V,E) with a length (or cost) function c : E ® Q≥ and two proper subsets R Ì V and R¢ Í R, a partial-terminal Steiner tree is a Steiner tree which contains all vertices in R such that all vertices in R¢ must be leaves. The partial-terminal Steiner tree problem is to find a partial-terminal Steiner tree of the minimum length in G. The previously best-known approximation ratio of the problem is 2ρ, where ρ is the approximation ratio of the Steiner tree problem. In this paper, we improve the ratio from 2ρ to 2ρ − (ρ/3ρ−2) − Î, where Î is some non-negative number.
Some properties of canonical correlations and variates in infinite dimensions
Authors: J. Cupidon, R. Eubank, D. Gilliam, F. Ruymgaart
Venue: Journal of Multivariate Analysis (2008)

In this paper the notion of functional canonical correlation as a maximum of correlations of linear functionals is explored. It is shown that the population functional canonical correlation is in general well defined, but that it is a supremum rather than a maximum, so that a pair of canonical variates may not exist in the spaces considered. Also the relation with the maximum eigenvalue of an associated pair of operators and the corresponding eigenvectors is not in general valid. When the inverses of the operators involved are regularized, however, all of the above properties are restored. Relations between the actual population quantities and their regularized versions are also established. The sample functional canonical correlations can be regularized in a similar way, and consistency is shown at a fixed level of the regularization parameter.
A novel non-block synchronous checkpointing scheme for distributed systems
Authors: B. Gupta, S. Rahimi
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper, we have proposed a new approach toward designing a simple and efficient nonblock synchronous checkpointing algorithm for distributed systems. In general, such algorithms require all processes to take checkpoints, even though some of them may not be necessary. In the present work, if a process since its last checkpoint has sent some message(s), but none of which has yet been received, the process does not take a checkpoint. It reduces the number of checkpoints to be taken. This approach offers advantage particularly in case of mobile computing environment where both non-block checkpointing and reduction in the number of checkpoints help in the efficient use of the limited resources of mobile computing environment.
Parallel genetic algorithms for the solution of inverse heat conduction problems
Authors: Q. Guo, D. Shen, Y. Guo, C. -H. Lai
Venue: International Journal of Computer Mathematics (2007)

A parallel genetic algorithm (PGA) is proposed for the solution of two-dimensional inverse heat conduction problems involving unknown thermophysical material properties. Experimental results show that the proposed PGA is a feasible and effective optimization tool for inverse heat conduction problems.
Efficient Thermal Aware Placement Approach Integrated with 3D DCT Placement Algorithm
Authors: Haixia Yan, Qiang Zhou, Xianlong Hong
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

3D ICs has the potential to reduce the interconnect delay, but thermal problem becomes one of the most serious challenges. In this paper, we proposed an efficient thermal aware 3D placement algorithm based on an efficient 3D DCT placement which unified cell distribution and wire length into one quadratic function through cosine transformation (DCT) and utilized iterative quadratic placement idea to get the solution. To utilize the advantage of DCT idea, thermal dissipation, cell distribution and wire length are integrated together elegantly in our proposed thermal aware placement algorithm. Thermal distribution was considered enough during placement process even when a cell was moved. Two fast methods to reflect thermal charge were proposed for thermal distribution computation. The experimental results shows our thermal aware 3D placement algorithm is efficient with about 3% reduction in average temperature and 15% in max temperature but a little perturbation on wirelength.
Computing proximal points of nonconvex functions
Authors: Warren Hare, Claudia Sagastiz&#x00e1;bal
Venue: Mathematical Programming: Series A and B (2008)

The proximal point mapping is the basis of many optimization techniques for convex functions. By means of variational analysis, the concept of proximal mapping was recently extended to nonconvex functions that are prox-regular and prox-bounded. In such a setting, the proximal point mapping is locally Lipschitz continuous and its set of fixed points coincide with the critical points of the original function. This suggests that the many uses of proximal points, and their corresponding proximal envelopes (Moreau envelopes), will have a natural extension from convex optimization to nonconvex optimization. For example, the inexact proximal point methods for convex optimization might be redesigned to work for nonconvex functions. In order to begin the practical implementation of proximal points in a nonconvex setting, a first crucial step would be to design efficient methods of approximating nonconvex proximal points. This would provide a solid foundation on which future design and analysis for nonconvex proximal point methods could flourish. In this paper we present a methodology based on the computation of proximal points of piecewise affine models of the nonconvex function. These models can be built with only the knowledge obtained from a black box providing, for each point, the function value and one subgradient. Convergence of the method is proved for the class of nonconvex functions that are prox-bounded and lower- $${\mathcal{C}}^2$$ and encouraging preliminary numerical testing is reported.
Selecting and constructing features using grammatical evolution
Authors: Dimitris Gavrilis, Ioannis G. Tsoulos, Evangelos Dermatas
Venue: Pattern Recognition Letters (2008)

A novel method for feature selection and construction is introduced. The method improves the classification accuracy, utilizing the well-established technique of grammatical evolution by creating non-linear mappings of the original features to artificial ones in order to improve the effectiveness of artificial intelligence tools such as multi-layer perceptron (MLP), Radial-basis-function (RBF) neural networks and nearest neighbor (KNN) classifier. The proposed method has been applied on a series of classification and regression problems and an experimental comparison is carried out against the accuracy obtained on the original features as well as on features created by the PCA method.
Exception-Aware Digital Rights Management Architecture Experimentation
Authors: Jean-Henry Morin, Michel Pawlak
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Considering Pervasive Computing environments and a global digital market having complex, often contradictory national and international regulations, it is impossible for rights holders to define universal Digital Rights Management (DRM) policies governing the usage of their content while still considering user rights. Exceptions are unanticipated usage situations where some rights should be waived while still maintaining a given level of persistent protection and governed usage. The industry and traditional DRM approaches haven’t considered such alternatives. To tackle this issue and demonstrate the feasibility of such an approach, this paper reports and discusses a proof of concept prototype implementation based on a model supporting exception management in DRM environments using credentials.
Operational experience with a virtual networking laboratory
Authors: Charlie Wiseman, Ken Wong, Tilman Wolf, Sergey Gorinsky
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Virtual laboratories are a potential replacement for standard laboratory facilities. Use of these virtual resources can reduce cost and maintenance overheads for teaching institutions while still ensuring that students have access to real equipment. Previous work indicates that students respond well to such environments, but one important operational aspect has been overlooked. In this work, we consider instructor overhead by comparing the amount of work required to teach courses with and without the use of a virtual laboratory. In particular, we examine two graduate computer networking courses, each taught with the standard software-only approach and then taught later with the Open Network Laboratory. Our data show that the effort required by the instructor to use a virtual laboratory is not much more than in a software-only environment, and that the increased interaction between student and instructor can be beneficial as the student questions are primarily focused on fundamental networking concepts.
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Authors: Reza Mahjourian, Feng Chen, Ravi Tiwari, My Thai, Hongqiang Zhai, Yuguang Fang
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in a minimum amount of time. At the same time, in order for the broadcast to proceed as predicted in the schedule, it must not contain parallel transmissions which can be conflicting based on the collision and interference parameters in the wireless network. Most existing work on this problem use a limited network model which accounts only for conflicts occurring inside the transmission ranges of the nodes. The broadcast schedules produced by these algorithms are likely to experience unpredictable delays when deployed in the network. This is because they do not take into consideration other important sources of conflict in parallel transmissions, namely the interference range and the carrier sensing range. In this paper we develop a conflict-aware network model, which uses these parameters to increase the probability of scheduling conflict-free transmissions, and thereby improve the reliability of the broadcast schedule. We present and prove correctness of a constant approximation algorithm for minimum-latency broadcast scheduling under this network model. We also present a greedy heuristic algorithm for the same problem. Experimental results are provided to evaluate the performance of our algorithms. In addition, the algorithms are analyzed to justify their performance trends.
Moving-Baseline Localization
Authors: Jun-geun Park, Erik D. Demaine, Seth Teller
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

The moving-baseline localization (MBL) problem arises when a group of nodes moves through an environment in which no external coordinate reference is available. When group members cannot see or hear one another directly, each node must employ local sensing and inter-device communication to infer the spatial relationship and motion of all other nodes with respect to itself. We consider a setting in which nodes move with piecewise-linear velocities in the plane, and any node can exchange noisy range estimates with certain sufficiently nearby nodes. We develop a distributed solution to the MBL problem in the plane, in which each node performs robust hyperbola fitting, trilateration with velocity constraints, and subgraph alignment to arrive at a globally consistent view of the network expressed in its own "rest frame." Changes in any node's motion cause deviations between observed and predicted ranges at nearby nodes, triggering revision of the trajectory estimates computed by all nodes.We implement and analyze our algorithm in a simulation informed by the characteristics of a commercially available UWB (ultra-wideband) radio, and show that recovering node trajectories (rather than just locations) requires substantially less computation at each node. Finally, we quantify the minimum ranging rate and local network density required for the method's successful operation.
CDMA Channel estimation with adaptive fuzzy filters
Authors: Antti Niemi, Timo Hämäläinen, Jyrki Joutsensalo
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

This paper proposes a hierarchical system of three adaptive fuzzy filters into the RAKE receiver to estimate the channel coefficients in a downlink multipath fading CDMA channel. The simplest filter is proved to be equivalent with the alpha tracker. In tested circumstances (Rayleigh fading with AWGN) the two simpler filters proved to be most useful. The nested nature of the filters makes it possible to construct a 'hybrid' filter according to the situation.
Guide focused crawler efficiently and effectively using on-line topical importance estimation
Authors: Ziyu Guan, Can Wang, Chun Chen, Jiajun Bu, Junfeng Wang
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Focused crawling is a critical technique for topical resource discovery on the Web. We propose a new frontier prioritizing algorithm, namely, the OTIE (On-line Topical Importance Estimation) algorithm, which efficiently and effectively combines link-based and content-based analysis to evaluate the priority of an uncrawled URL in the frontier. We then demonstrate OTIE's advantages over traditional prioritizing algorithms by real crawling experiments.
Bootstrapping pay-as-you-go data integration systems
Authors: Anish Das Sarma, Xin Dong, Alon Halevy
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Data integration systems offer a uniform interface to a set of data sources. Despite recent progress, setting up and maintaining a data integration application still requires significant upfront effort of creating a mediated schema and semantic mappings from the data sources to the mediated schema. Many application contexts involving multiple data sources (e.g., the web, personal information management, enterprise intranets) do not require full integration in order to provide useful services, motivating a pay-as-you-go approach to integration. With that approach, a system starts with very few (or inaccurate) semantic mappings and these mappings are improved over time as deemed necessary. This paper describes the first completely self-configuring data integration system. The goal of our work is to investigate how advanced of a starting point we can provide a pay-as-you-go system. Our system is based on the new concept of a probabilistic mediated schema that is automatically created from the data sources. We automatically create probabilistic schema mappings between the sources and the mediated schema. We describe experiments in multiple domains, including 50-800 data sources, and show that our system is able to produce high-quality answers with no human intervention.