ppxscal/embedding_network huggingface dataset:
Boosting with incomplete information
Authors: Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. We use auxiliary functions to bound the change of the loss functions and derive explicit parameter update rules for the learning algorithms. We demonstrate encouraging results on two real-world problems --- visual object recognition in computer vision and named entity recognition in natural language processing --- to show the effectiveness of the proposed boosting approach.
Considerations for Improving the Performance of Surface Plasmon Resonance Biosensors
Authors: Zhang Yingying, Lai Jiancheng, Wang Chunyong, Li Zhenhua
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

There are four types of currently used SPR biosensors for the detection of biomolecular interaction. Their sensitivities and noise immunity based on angular and wavelength interrogation are calculated and compared. The results show that the conventional SPR biosensor which takes the advantage of the highest sensitivity suffers the worst noise immunity among all the SPR biosensors. Although the WCSPR biosensors has a better noise immunity than the conventional SPR, it nevertheless exhibits inferior noise immunity to the LRSPR and CPWR biosensors because of their very narrow dips in the reflection curves. Under angular interrogation, the noise limited resolutions of the LRSPR and CPWR biosensors are higher than that of the other two types; while the LRSPR has the highest resolution for wavelength interrogation. The influence of the probe beam divergence is also discussed. The divergence has more serious effect on the sensor which has narrower and sharper dip and results in the shift of the resonance position and the broadening of the FWHM, which decays the noise immunity of the sensor.
Agglomerative independent variable group analysis
Authors: Antti Honkela, Jeremias Seppä, Esa Alhoniemi
Venue: Neurocomputing (2008)

Independent variable group analysis (IVGA) is a method for grouping dependent variables together while keeping mutually independent or weakly dependent variables in separate groups. In this paper two variants of an agglomerative method for learning a hierarchy of IVGA groupings are presented. The method resembles hierarchical clustering, but the choice of clusters to merge is based on variational Bayesian model comparison. This is approximately equivalent to using a distance measure based on a model-based approximation of mutual information between groups of variables. The approach also allows determining optimal cutoff points for the hierarchy. The method is demonstrated to find sensible groupings of variables that can be used for feature selection and ease construction of a predictive model.
Expressive Declassification Policies and Modular Static Enforcement
Authors: Anindya Banerjee, David A. Naumann, Stan Rosenberg
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed. Secondly, an end-to-end semantic property is introduced, based on a model that allows observations of intermediate low states as well as termination. An attacker's knowledge only increases at explicit declassification steps, and within limits set by policy. Thirdly, static enforcement is provided by combining type-checking with program verification techniques applied to the small subprograms that carry out declassifications. Enforcement is proved sound for a simple programming language and the extension to object-oriented programs is described.
A proposed new approach for extracting complex building boundaries from segmented LiDAR data
Authors: Jeong-Ho Lee, Soo-Hee Han, Young-Gi Byun, Kiyun Yu, Yong-Il Kin
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Many studies have been conducted on extracting building boundaries from LiDAR (Light Detectino And Ranging) data. In these studies, points are first segmented, then are further generalized or regularized to acquire straight boundary lines that better approximate the real boundaries. In most research in this area, such generalization or regularization assumes that buildings have only right angles, i.e., all the line segments of the building boundaries are either parallel or perpendicular to each other. However, this assumption is not valid for many buildings, and restricts wider applications of this type of study. We present a new approach consisting of three steps that is applicable to more complex building boundaries. The three steps consist of boundary tracing, generalization, and regularization. Each step contains algorithms that range from slight modifications of conventional algorithms to entirely new concepts. Four typical building shapes were selected to test the performance of our new approach. Our results show that our proposed approach has good potential for extracting building boundaries of various shapes.
Direct method to solve Volterra integral equation of the first kind using operational matrix with block-pulse functions
Authors: E. Babolian, Z. Masouri
Venue: Journal of Computational and Applied Mathematics (2008)

This article proposes a simple efficient direct method for solving Volterra integral equation of the first kind. By using block-pulse functions and their operational matrix of integration, first kind integral equation can be reduced to a linear lower triangular system which can be directly solved by forward substitution. Some examples are presented to illustrate efficiency and accuracy of the proposed method.
InGaP/InGaAs complementary pseudomorphic doped-channel HFETs
Authors: Jung-Hui Tsai, Der-Feng Guo, Chien-Ming Li, Ning-Xing Su, Yin-Shan Huang, Yi-Zhen Wu
Venue: Proceedings of the 1st WSEAS International Conference on Computational Chemistry (2007)

The device and inverter characteristics based on InGaP/InGaAs n-and p-channel complementary pseudomorphic doped-channel HFETs are demonstrated. Particularly, the saturation voltage of the n-channel device is substantially reduced because the two-dimensional electron gas (2DEG) is formed and modulated in the InGaAs strain channel. Experimentally, an extrinsic transconductance of 109 (11.5) mS/mm and a saturation current density of 32.5 (-27) mA/mm are obtained for the n-channel (p-channel) device. Furthermore, the noise margins NMH and NML values are up to 1.317 and 0.28 V, respectively, at a supply voltage of 2.0 V for complementary logic inverter application.
Collaborative query processing among heterogeneous sensor networks
Authors: Yuan He, Mo Li, Yunhao Liu
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

Demands on better interacting with physical world require an effective and comprehensive collaboration mechanism among multiple heterogeneous sensor networks. Previous works mainly focus on improving each single and specific sensor network, thus fail to address this newly emerged issue. In this paper, we study the issue of collaborative query processing among multiple heterogeneous sensor networks and formulate it into an optimization problem with respect to energy efficiency, called EE-QPS. To the best of our knowledge, we are the first one considering the collaborative query processing among heterogeneous sensor networks. By utilizing the implications among sensor networks, we design a heuristic approach named IAP to resolve EE-QPS. The experimental results validate our scheme and show that IAP achieves optimized energy efficiency under various environments.
Bandwidth-Satisfied Multicast Trees in MANETs
Authors: Chia-Cheng Hu, Eric Hsiao-Kuang Wu, Gen-Huey Chen
Venue: IEEE Transactions on Mobile Computing (2008)

Previous quality-of-service (QoS) routing/multicasting protocols in mobile ad-hoc networks determined bandwidth-satisfied routes for QoS applications. However, they suffer from two bandwidth-violation problems, named the hidden route problem (HRP) and the hidden multicast route problem (HMRP). HRP may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Similarly, HMRP may arise when multiple flows are permitted concurrently. Without considering the bandwidth consumption of two-hop neighbors is the reason why the two problems are introduced. In this paper, a novel algorithm that can avoid the two problems is proposed to construct bandwidth-satisfied multicast trees for QoS applications. Further, it also aims to minimize the number of forwarders so as to reduce bandwidth and power consumption. Simulation results show that the proposed algorithm can improve the network throughput.
Implementation of interior-point algorithms for some entropy optimization problems
Authors: Chi-Guen Han, Panos M. Pardalos, Yinyu Ye
Venue: Optimization Methods Software (1992)

In this paper we discuss computational and implementation aspects of the potential reduction interior-point algorithm [17] for solving entropy optimization problems arisen in practical applications. The algorithm generates an ε-optimal solution within the number of iterations bounded by [image omitted]   where ε is the error tolerance, n is the number of nonnegative variables, and each iteration solves a system of linear equations. Preliminary computational results obtained from solving several image reconstruction problems are presented.
Where did the researchers go?: supporting social navigation at a large academic
Authors: Rosta Farzan, Peter Brusilovsky
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

Dealing with the information overload is an important challenge. Over the last decade researchers have tried to tackle that problem using social technologies. We present a social information access system that helps researchers attending a large academic conference to plan talks they wish to attend. More specifically, we have tried to address the problem of collecting reliable feedback from the community of users. Following "do it for yourself" approach, the system encourages users to add interesting talks to their individual schedules and uses scheduling information for social navigation support. We also report results of evaluation of the system at the ELearn 2007 conference.
Sidewalk following using color histograms
Authors: John S. Seng, Thomas J. Norrie
Venue: Journal of Computing Sciences in Colleges (2008)

In this paper, we present the development of an algorithm for sidewalk following for a mobile robot. The algorithm classifies pixels of a video frame as either sidewalk or background. The classification of pixels is performed using color histograms of the hue and saturation of various areas of an image taken by an on-board camera. This color histogram approach allows the algorithm to detect and follow concrete paved areas of arbitrary shape and color. The development of the algorithm is performed using a robotics research platform developed by undergraduate students at Cal Poly State University, San Luis Obispo.
The Adoption of E-Business by Organizations in China: An Institutional Perspective
Authors: Nir Kshetri
Venue: Electronic Markets (2007)

The Chinese e-business industry has a number of unusual features. Institutional factors such as strong nationalism, the state's entrenchment in the economy, political cognitive and political normative factors, regulative uncertainty, the role of professional associations, and the importance of business and social networks are deeply reflected in China's e-business development pattern. We argue that by approaching the Chinese e-business industry from the standpoint of institutional theory, we can capture these complex factors facilitating and hindering China's rapidly growing e-business industry. We thus employ an institutional perspective to explain the Chinese e-business landscape. In addition to advancing research on e-business in China, this paper also highlights several directions for future inquiry and implications for managers and policymakers.
Fairness and optimal stochastic control for heterogeneous networks
Authors: Michael J. Neely, Eytan Modiano, Chih-Ping Li
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.
Towards Advance Reservation in Large-Scale Grids
Authors: Leonardo Kunrath, Carlos Becker Westphall, Fernando Luiz Koch
Venue: Proceedings of the Third International Conference on Systems (2008)

Advance resource reservations allow clients to have exclusive access to Grid resources. The goal is to deliver higher levels of Quality of Service. However, in practice, the support for advance reservations in Grids has been restricted to processor reservations on clusters or bandwidth reservation on high speed LANs. This is a shortcoming in current Grid architectures. In this paper, we present an analysis of current resource reservation strategies and propose a new approach to extend advance reservations to almost any Grid node. We validate our approach through the implementation of a resource scheduler and two highly scalable scheduling algorithms. We also verify the algorithms performance through simulation. The results show that the resource utilization rate can be over 90% depending on the number of reservations.
Experimental investigation of a mathematical model for traveling wave ultrasonic motors
Authors: M. T. El Hagry, A. A. Mahfouz, H. S. Ahmed
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Ultrasonic motors have many excellent performance features such as high-holding torque, high driving torque at low speed, silent operation, compactness, and no electromagnetic interferences. Due to such characteristics these motors have a potential for many applications such as automation, and robotics. The performance estimation of the ultrasonic motor is a function of operating conditions such as stiffness, number of piezoelectric segments, motor diameter, etc. Such performance is modeled using the accurate parameters of the motor. In this paper, the derivation of a mathematical model for traveling wave ultrasonic motors and its experimental validation is presented. The different components of the motor have been modeled individually. The resulting submodels are then assembled together to give the model of the complete motor. In order to validate the model, it is simulated with properly parameters and compared with experimental results obtained from an actual traveling wave ultrasonic motor "Shinsei USR60". Good agreement is obtained between simulated and experimental results.
Distributed Kalman filtering for cascaded systems
Authors: Z. Lendek, R. Babuška, B. De Schutter
Venue: Engineering Applications of Artificial Intelligence (2008)

The Kalman filter provides an efficient means to estimate the state of a linear process, so that it minimizes the mean of the squared estimation error. However, for naturally distributed applications, the construction and tuning of a centralized observer may present difficulties. Therefore, we propose the decomposition of a linear process model into a cascade of simpler subsystems and the use of a Kalman filter to individually estimate the states of these subsystems. Both a theoretical comparison and simulation examples are presented. The theoretical results show that the distributed observers, except for special cases, do not minimize the overall error covariance, and the distributed observer system is therefore suboptimal. However, in practice, the performance achieved by the cascaded observers is comparable and in certain cases even better than the performance of the centralized observer. A distributed observer system also leads to increased modularity, reduced complexity, and lower computational costs.
Learning to learn implicit queries from gaze patterns
Authors: Kai Puolamäki, Antti Ajanki, Samuel Kaski
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In the absence of explicit queries, an alternative is to try to infer users' interests from implicit feedback signals, such as clickstreams or eye tracking. The interests, formulated as an implicit query, can then be used in further searches. We formulate this task as a probabilistic model, which can be interpreted as a kind of transfer or meta-learning. The probabilistic model is demonstrated to outperform an earlier kernel-based method in a small-scale information retrieval task.
Experimental control of a single-link flexible robot arm using energy shaping
Authors: A. Sanz, V. Etxebarria
Venue: International Journal of Systems Science (2007)

Flexible-link robotic manipulators are mechanical devices whose control can be rather challenging, among other reasons because of their intrinsic under-actuated nature. This paper presents the application of an energy-based control design methodology (the so-called IDA-PBC, interconnection and damping assignment passivity-based control) to a single-link flexible robotic arm. It is shown that the method is well suited to handle this kind of under-actuated device not only from a theoretical viewpoint but also in practice. A Lyapunov analysis of the closed-loop system stability is given and the design performance is illustrated by means of a set of simulations and laboratory control experiments, comparing the results with those obtained using conventional control schemes for mechanical manipulators.
No bit left behind: the limits of heap data compression
Authors: Jennifer B. Sartor, Martin Hirzel, Kathryn S. McKinley
Venue: Proceedings of the 7th international symposium on Memory management (2008)

On one hand, the high cost of memory continues to drive demand for memory efficiency on embedded and general purpose computers. On the other hand, programmers are increasingly turning to managed languages like Java for their functionality, programmability, and reliability. Managed languages, however, are not known for their memory efficiency, creating a tension between productivity and performance. This paper examines the sources and types of memory inefficiencies in a set of Java benchmarks. Although prior work has proposed specific heap data compression techniques, they are typically restricted to one model of inefficiency. This paper generalizes and quantitatively compares previously proposed memorysaving approaches and idealized heap compaction. It evaluates a variety of models based on strict and deep object equality, field value equality, removing bytes that are zero, and compressing fields and arrays with a limited number and range of values. The results show that substantial memory reductions are possible in the Java heap. For example, removing bytes that are zero from arrays is particularly effective, reducing the application's memory footprint by 41% on average.We are the first to combine multiple savings models on the heap, which very effectively reduces the application by up to 86%, on average 58%. These results demonstrate that future work should be able to combine a high productivity programming language with memory efficiency.
Spectral analysis and classification accuracy of coffee crops using Landsat and a topographic-environmental model
Authors: S. Cordero-Sancho, S. A. Sader
Venue: International Journal of Remote Sensing (2007)

Coffee is an extremely important cash crop, yet previous work indicates that satellite mapping of coffee has produced low classification accuracy. This research examines spectral band combinations and ancillary data for evaluating the classification accuracy and the nature of spectral confusion between coffee and other cover types in a Costa Rican study area. Supervised classification using Landsat Enhanced Thematic Mapper (ETM+) with only red, near-infrared, and mid-infrared bands had significantly lower classification accuracy compared to datasets that included more spectral bands and ancillary data. The highest overall accuracy achieved was 65%, including a coffee environmental stratification model (CESM). Producer's and user's accuracy was highest for shade coffee plantations (91.8 and 61.1%) and sun coffee (86.2 and 68.4%) with band combination ETM+ 34567, NDVI, cos (i), and including the use of the CESM. Post-classification stratification of the optimal coffee growing zone based on elevation and precipitation data did not show significant improvement in land cover classification accuracy when band combinations included both the thermal band and NDVI. A forward stepwise discriminant analysis indicated that ETM+ 5 (mid-infrared band) had the highest discriminatory power. The best discriminatory subset for all woody cover types including coffee excluded ETM+ 3 and 7; however, the land cover accuracy assessment indicated that overall accuracy, as well as producer's and user's accuracy of shade and sun coffee, were slightly improved with the inclusion of these bands. Although spectral separation between coffee crops and woodland areas was only moderately successful in the Costa Rica study, the overall accuracy, as well as the sun and shade coffee producer's and user's accuracy, were higher than reported in previous research.
Reputation of Communities of Web Services - Preliminary Investigation
Authors: Said Elnaffar, Zakaria Maamar, Hamdi Yahyaoui, Jamal Bentahar, Philippe Thiran
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Web services communities can be seen as virtual clusters that agglomerate Web services with the same functionality (e.g., FlightBooking). However, selecting a community to deal with is a challenging task to users and providers. Reputation, besides other selection criteria, has been widely used for evaluating and ranking candidates. Interestingly, the definition of community reputation from the perspective of users differs from the perspective of Web service providers. In this paper, we introduce a reputation-based Web services community architecture and define some of the performance metrics that are needed to assess the reputation of a Web service community as perceived by users and providers.