ppxscal/embedding_network huggingface dataset:
Mean analysis of an online algorithm for the vertex cover problem
Authors: Etienne Birmelé, François Delbot, Christian Laforest
Venue: Information Processing Letters (2009)

In 2005, Demange and Paschos proposed in [M. Demange, V.Th. Paschos, On-line vertex-covering, Theoret. Comput. Sci. 332 (2005) 83-108] an online algorithm (noted LR here) for the classical vertex cover problem. They shown that, for any graph of maximum degree @D, LR constructs a vertex cover whose size is at most @D times the optimal one (this bound is tight in the worst case). Very recently, two of the present authors have shown in [F. Delbot, C. Laforest, A better list heuristic for vertex cover, Inform. Process. Lett. 107 (2008) 125-127] that LR has interesting properties (it is a good ''list algorithm'' and it can easily be distributed). In addition, LR has good experimental behavior in spite of its @D approximation (or competitive) ratio and the fact that it can be executed without the knowledge of the full instance at the beginning. In this paper we analyze it deeper and we show that LR has good ''average'' performances: we prove that its mean approximation ratio is strictly less than 2 for any graph and is equal to 1+e^-^2~1.13 in paths. LR is then a very interesting algorithm for constructing small vertex covers, despite its bad worst case behavior.
Integration of low dimensional crystalline Si into functional epitaxial oxides
Authors: Apurba Laha, E. Bugiel, R. Dargis, D. Schwendt, M. Badylevich, V. V. Afanas'ev, A. Stesmans, A. Fissel, H. J. Osten
Venue: Microelectronics Journal (2009)

In this work we show that by efficiently exploiting the growth kinetics during molecular beam epitaxy (MBE) one could create Si nanostructures of different dimensions. Examples are Si quantum dots (QD) or quantum wells (QW), which are buried into an epitaxial rare-earth oxide, e.g. Gd2O3. Electrical measurements carried out on Pt/Gd2O3/Si MOS capacitors comprised with Si-QD demonstrate that such well embedded Si-QD with average size of 5nm and density of 2x1012cm-2 exhibit very good charge storage capacity with suitable retention (~105s) and endurance (~105 write/erase cycles) characteristics. The Pt/Gd2O3/Si (metal-oxide-semiconductor (MOS)) basic memory cells with embedded Si-QD display large programming window (~1.5-2V) and fast writing speed and hence could be a potential candidate for future non-volatile memory application. The optical absorption of such Si-QD embedded into epitaxial Gd2O3 was found to exhibit a spectral threshold maximum up to 2.9+±0.1eV depending on their sizes, inferring a significant influence of quantum confinement on the QD/oxide interface band diagram. Ultra-thin single-crystalline Si-QW with epitaxial insulator (Gd2O3) as the barrier layers were grown by a novel approach based on cooperative vapor phase MBE on Si wafer with sharp interfaces between well and barriers. The current-voltage characteristics obtained for such structure exhibits negative differential resistance at lower temperature, making them a good candidate for resonant tunneling devices.
Investigating the impact of video games on high school students' engagement and learning about genetics
Authors: Leonard A. Annetta, James Minogue, Shawn Y. Holmes, Meng-Tzu Cheng
Venue: Computers Education (2009)

The popularity of video games has transcended entertainment crossing into the world of education. While the literature base on educational gaming is growing, there is still a lack of systematic study of this emerging technology's efficacy. This quasi-experimental study evaluated a teacher created video game on genetics in terms of its affective and cognitive impact on student users. While statistical results indicated no differences (p>.05) in student learning as measured by our instrument, there were significant differences (p
Polarization rotation analysis of semiconductor optical amplifiers and switching application
Authors: Zhengyong Li, Chongqing Wu, C. Y. Tian, P. Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

By means of polar decomposition of the Mueller matrix, we analyze polarization rotation (PR) effects in SOAs and demonstrate the PR angle is linear to the birefringence dependent gain (BDG). Then we further investigate the photoinduced PR (PPR) and cross-gain modulation (XGM) effects in a pump-probe scheme, and realize the orthogonal PR by control of a high-intensity pump laser. Finally we perform the polarization switching (PS) based on PPR with data rate at 2.5 G-bit/s. The switching speed of our PS is ~300 ps, which is highly promising to be further upgraded.
Application of Intelligent Control Techniques for Temperature-Humidity Control in Industrial Workshops
Authors: Yingjun Guo, Dongfang Cao, Guang Zheng
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

By analyzing the difference of an air conditioning control system used in industrial workshops and buildings, it is indicated that the current method used in the air conditioning system is not suitable for temperature and humidity control in industrial workshops. An intelligent control method is given based on the improved fuzzy techniques. The detailed design and realization of the intelligent temperature-humidity controller are discussed in this paper. The controller does not need the object’s mathematic model, but applies control face partly serializing based on the basic fuzzy control algorithm to achieve the rapidity of table-checking and formula method and the accuracy of online reasoning method. The application results proved that control system has good performances in the rapid response and robustness to disturbances.
Issues and methods for practical distributed data processing applications: II
Authors: Maurice Blackman, Hugh Ryan
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper presents methods for the second of two key activities in the creation of practical distributed data processing (DDP) systems for business computing. The first activity, discussed in a companion paper, is to select a configuration of hardware and software to support the implementation of a multiapplication plan. The second, discussed in this paper, is to select data distribution and manipulation approaches for one application within the limits set by the results of the first activity. The paper assumes the definition of DDP established in the prior paper. It identifies some of the issues that constrain a commercial establishment with limited research funds and that justify the limitation of practical alternatives assumed as a basis for the methods.
A New Model of Nature Images Based on Generalized Gaussian Distribution
Authors: Xu Mankun, Li Tianyun, Ping Xijian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

We propose a new statistical model of nature images named 2D joint differential image histogram (JDIH). To simulate this model, we define a kind of 2D generalized Gaussian distribution (GGD) symmetrically in every direction by extending the 1D GGD function. The 2D JDIH and its estimated parameters can efficiently measure the image's inner and inter correlations of local areas in a special direction or between different directions. Because the correlations in nature images behave like image textures, JDIH and DIH can measure the texture complexity of nature images and are useful in many fields of image analysis.
Boosting Relational Sequence Alignments
Authors: Andreas Karwath, Kristian Kersting, Niels Landwehr
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impractical: the number of states grows very quickly with the number of domain objects and relations among these objects. Relational sequence alignment aims at exploiting symbolic structure to avoid the full enumeration. This comes at the expense of a more complex reward model selection problem: virtually infinitely many abstraction levels have to be explored. In this paper, we apply gradient-based boosting to leverage this problem. Specifically, we show how to reduce the learning problem to a series of relational regressions problems. The main benefit of this is that interactions between states variables are introduced only as needed, so that the potentially infinite search space is not explicitly considered. As our experimental results show, this boosting approach can significantly improve upon established results in challenging applications.
Complex business systems: a strategy for success
Authors: Naomi Lee Bloom
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper deals with the development of complex business systems from two perspectives: (1) What role must be played by the project manager and other members of the project team to ensure a cost-effective and timely solution to the right business problems; and (2) What project organization and management techniques can be used to facilitate communications and decision-making among the project team, users, data center personnel, and other project participants.
A Planning Graph Based Algorithm for Semantic Web Service Composition
Authors: Yuhong Yan, Xianrong Zheng
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Many automatic Web service composition algorithms based on AI planning techniques have been proposed. In this paper, we model the semantic Web service composition problem using a kind of simplified planning graph. It provides a unique search space, and can find a solution in polynomial time, but with possible redundant Web services.
Personalised time-dependent learning
Authors: R. Benlamri, Y. Atif, J. Berri
Venue: International Journal of Learning Technology (2009)

Time-dependent instruction appears to shape next-generation learning systems, where the value of instruction is as important as the time it takes to learn. The ability to grasp the exact knowledge required to accomplish a specific task, in the allotted time, is a key factor for organisations to remain economically competitive in the new knowledge society era. Time-constrained learning is a new concept which requires a multilevel cognitive organisation of knowledge to suit various learning profiles. This paper proposes an ontology-based authoring tool capable of mapping concepts to learning resources to different granularity levels, hence customising learning-delivery to time-constrained learners. The proposed framework in this paper distils knowledge to meet timeliness using a judicious application of real-time systems principles. This interdisciplinary learning design advocates progressive levels of learning which trade learning granularity with allocated instruction time. The paper provides performance and experimental studies using an evaluation model and a validation approach through use cases. The results show interesting performance tradeoffs in analysing the cognitive perception of time-dependent learning.
Using E-Mail SPAM DNS Blacklists for Qualifying the SPAM-over-Internet-Telephony Probability of a SIP Call
Authors: M. Hirschbichler, C. Egger, O. Pasteka, A. Berger
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

SPIT is an upcoming threat for receiving unsolicited messages in Voice over IP systems. We assume, that future SPIT will be sent through the same infrastructure as SPAM today, namely through a network of compromised hosts. Therefore spammers will see SPIT as an additional business case. In this paper we show a viable way to increase the hit rate of a SPIT detection system. Our proposal is to query e-mail SPAM blacklists for IP addresses which are sent with SIP/SDP messages. We enabled a well-established e-mail filter application to handle information out of these messages. We also present the performance of such a solution with respect to call setup delays and success rates.
Collaborative Video Scene Annotation Based on Tag Cloud
Authors: Daisuke Yamamoto, Tomoki Masuda, Shigeki Ohira, Katashi Nagao
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we propose a video scene annotation method based on tag clouds. First, user comments associated with a video are collected from existing video sharing services. Next, a tag cloud is generated from these user comments. The tag cloud is displayed on the video window of the Web browser. When users click on a tag included in the tag cloud while watching the video, the tag gets associated with the time point of the video. Users can share the information on the tags that have already been clicked. We confirmed that the coverage of annotations generated by this method is higher than that of the existing methods, and users are motivated to add tags by using tag-sharing and tag-cloud methods. This method assists in establishing highly accurate advanced video applications.
Performance evaluation in database research: principles and experience
Authors: Stefan Manegold, Ioana Manolescu, Stefan Manegold, Ioana Manolescu
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A significant part of today's database research focuses on improving performance of a specific system. Quantitative experiments are the best way to validate such results. However, performing experiments is not always easy. Besides the complexity of the system under test, designing an experiment, choosing the right environment and parameter values, analyzing the data which is gathered, and reporting it to a third party in an expressive and intelligible way is hard. In this tutorial, we present a general road-map to the above steps, including tips and tricks on how to organize and present code that performs experiments, so that an outsider can repeat them. The tutorial is primarily aimed at MS and PhD students seeking to improve their experiment practices, but more senior attendants may also find it interesting.
An Improved Distributed Key Management Scheme in Wireless Sensor Networks
Authors: Jun Zhou, Mingxing He
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

A distributed key management scheme and the robust continuity of group key establishment are realized in this paper. This scheme derives the concept of seed members who are responsible for the management of users' joining and revocation operations by using secret sharing techniques and Modified Blom's symmetric key establishment mechanism. Besides, a novel seed member alternation mechanism which can efficiently resist of node capture attacks and revocation attacks leaves the resources much more balanced among the sensor nodes to prolong the lifetime of WSNs. Finally, The key continuity enables all the sensors to establish and update both of the pair-wise key and group key with the same key pre-distribution information, which significantly decreases the resource consuming of key management in distributed sensor networks. By comparison, this scheme outperforms most of the existing schemes in terms of network security, key connectivity and complexity of storage as well as communication.
A credibility analyzing method of geographical objects from digital maps
Authors: Daisuke Kitayama, Ryong Lee, Kazutoshi Sumiya
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Digital maps is widely used and appears on all types of platforms for integrating content. However, map media contain a large amount of content and updates. In addition, update times are different for each supplier. Digital maps often display nonexisting geographical objects or do not display newly created geographical objects. In other words, map media has no credibility. Users who believe that a digital map is correct may encounter problems. We propose a calculating method for determining an object's existence value in displayed geographical objects in digital maps for map credibility. In particular, we extract temporal web pages of each geographical object using co-occurring geographical objects. We calculate the degree of existential support using update history of temporal web pages. Finally, we calculate an object existence value based on all degrees of support. We display map content with valid object for deciding map credibility. We developed a prototype system and evaluated our proposed method.
2DVTE: A two-directional videotext extractor for rapid and elaborate design
Authors: Tsung-Han Tsai, Yung-Chien Chen, Chih-Lun Fang
Venue: Pattern Recognition (2009)

In video indexing and summarization, videotext is the very compact and accurate information. Most videotext detection and extraction methods only deal with the static videotext on video frames. Few methods can handle motion videotext efficiently since motion videotext is hardly extracted well. In this paper, we propose a two-directional videotext extractor, called 2DVTE. It is developed as an integrated system to detect, localize and extract the scrolling videotexts. First, the detection method is carried out by edge information to classify regions into text and non-text regions. Second, referring to the localization on scrolling videotext, we propose the two-dimensional projection profile method with horizontal and vertical edge map information. Considering the characteristics of Chinese text, the vertical edge map is used to localize the possible text region and horizontal edge map is used to refine the text region. Third, the extraction method consists of dual mode adaptive thresholding and multi-seed filling algorithm. In the dual mode adaptive thresholding, it produces the non-rectangle pattern to divide the background and foreground more precisely. Referring to the multi-seed filling algorithm, it is based on the consideration of the minimum and maximum length and four directions of the stroke while the previous method only considers the minimum length and two directions of the stroke. With this multi-seed exploitation on strokes, precise seeds are obtained to produce more sophisticated videotext. Considering high throughput and the low complexity issue, we can achieve a real-time system on detecting, localizing, and extracting the scrolling videotexts with only one frame usage instead of multi-frame integration in other literatures. According to the experiment results on various video sequences, all of the horizontal and vertical scrolling videotexts can be extracted precisely. We also make comparisons with other methods. In our analysis, the performance of our algorithm is superior to other existing methods in speed and quality.
Information Theoretic Classification of Problems for Metaheuristics
Authors: Kent C. Steer, Andrew Wirth, Saman K. Halgamuge
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper proposes a model for metaheuristic research which recognises the need to match algorithms to problems. An empirical approach to producing a mapping from problems to algorithms is presented. This mapping, if successful, will encapsulate the knowledge gained from the application of metaheuristics to the spectrum of real problems. Information theoretic measures are suggested as a means of associating a dominant algorithm with a set of problems.
Monte Carlo modelling and simulation of cell exocytosis
Authors: Amparo Gil, Virginia Gonzalez-Velez, Javier Segura
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

We describe our Monte Carlo approach to the modelling of an active zone of an exocytotic cell, in order to study Ca2+and secretion dynamics. Following a microscopic point of view and the stochastic nature of cell events, we have modelled the main Ca2+-regulation processes associated with hormone and neurotransmitter release. Two specific examples are considered for simulation: a nerve terminal and a chromaffin cell, which account for fast and slow exocytosis, respectively.
eCommerce solutions and eLeadership: impact analyses at historically black colleges and universities and their organizational leadership
Authors: Wilhelmina Djoleto
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Existing literature reveals a significant surge in the investment in Electronic Commerce (eCommerce) solutions at Higher Educational Institutions (HEIs) globally. However, there is little or no research on their successes and failures and many HEIs are interested in attaining a clear understanding of the returns on their investments. Furthermore, no known research has been conducted to reconnoitre the effect of these eCommerce solutions on organizational leadership/hierarchies at HEIs, especially, when this is considered to be critical to institutions' strategic mission and planning. This paper presents a comprehensive impact analysis of eCommerce solutions at Historically Black Colleges and Universities (HBCUs), by reconnoitring their effects on different operational constructs of the institutions. Choosing HBCUs for this study galvanised from their uniqueness and their numerous roles in providing education for minorities. We utilized cross-sectional quantitative approach and we surveyed a significant spectrum of such institutions across the United States of America. The impact of eCommerce solutions on institutional leadership, student enrolment, investment, image and reputation, student's satisfaction, student learning, and other optional activities, are described in this paper.
Accurate Location Estimation for a Dynamically Moving Object Using Modified Particle Filter Algorithm
Authors: N. Karthick, Keshav Prashanth, K. Venkatraman, Amutha Nanmaran, J. Naren
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The need for Ubiquitous computing technology is expected to become very small and reasonably cheap in the future,large amounts of electronic items can be deployed almost everywhere. This perspectives makes us interesting to take a look at scenarios where small chips would become so plentiful that this will not only allow identification of relatively valuable single objects but could also be simply distributed over surfaces, like in scenarios emerging from sensor networks research. We introduce a new method for locating objects in a dynamically changing environment. Yet, for instance, RFID tags attached to mobile objects provide us with interesting new applications, like allowing mobile devices to obtain their current location or context information on the spot, without rather expensive positioning calculations. Our modified particle filter algorithm provide better accuracy in locating a dynamically moving object in a Library, where the speed of movement is within specified limits.