ppxscal/embedding_network huggingface dataset:
FL-LIMS: laboratory information management system as an intelligent system
Authors: Diana Calva Mendez, Mario Lehman
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Laboratory Information Management Systems (LIMS) have been in use since the mid seventies. Today the laboratory needs, have more to do with decision support and decision making. Depending on the problem needed to be solved, a different and unique method of artificial intelligence would have to be implemented that could easily interact with the database search engines each LIMS uses. Here we identify some of these new problems to be solved by a LIMS, the possible alternatives that could be implemented in order to solve them and include an example based on fuzzy logic.
SSL-Based Lightweight Security of IP-Based Wireless Sensor Networks
Authors: Wooyoung Jung, Sungmin Hong, Minkeun Ha, Young-Joo Kim, Daeyoung Kim
Venue: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops (2009)

IP-based wireless sensor networks (IP-WSN) are popularly recognized as a global sensor networks infrastructure by combining IPv6 technology with wireless sensor networks (WSN). However, IP-WSN, currently, does not provide security because it is commonly recognized that it is a big burden for IP-WSN to adapt Internet's dominant security protocol. We suggest a security protocol for IP-WSN based on Secure Sockets Layer (SSL). We have developed IP-WSN sensor node hardware with 16-bit MSP430 MCU including 116 KB Flash and 8 KB RAM, and implemented IP-WSN software stack and lightweight SSL components. The resource consumption is around 64 KB of Flash and 7 KB of RAM when it is used that ECC for key-exchange and authentication, RC4 for data encryption, and MD5 for hashing. And it takes total 2 s for a full SSL handshake and a 127 bytes packet transfer. It can make IP-WSN secure and be used for the public and private services such as military observation, healthcare, and home-network.
Low-Power Design Solutions for Wireless Multimedia SoCs
Authors: Jean-Pierre Schoellkopf, Philippe Magarshack
Venue: IEEE Design Test (2009)

Editor's note:With advanced semiconductor technology nodes, power management has become a global problem. In battery powered applications, this problem is even more critical. This article describes a range of design solutions that ST Microelectronics uses to manage dynamic and static power while meeting its targets for area and performance.&#x2014;Yervant Zorian, Virage Logic
Pier: internet scale p2p query processing with distributed hash tables
Authors: Joseph M. Hellerstein
Venue:  (2008)

Distributed database systems have long been a topic of interest in the database research community. Existing designs focus on two principles; make the distribution transparent to users and provide a rich declarative query language with strict semantic guarantees. As a result, they have modest targets for network scalability with none of these systems being deployed on much more than a handful of distributed sites. The Internet community has recently become interested in distributed query processing. Not surprisingly, they approach this problem from a very different angle than the traditional database literature. The fundamental goal of Internet systems is to operate at very large scale (thousands if not millions of nodes). To achieve this degrees of scale, these system sacrifice transparency and/or flexibility. This thesis develops a system called PIER (which stands for "Peer-to-Peer Information Exchange and Retrieval") which provides a rich query language that provides location transparency and scalability with relaxed semantics. We explore the architecture of PIER, develop techniques for query processing (with specific focus on aggregation and join operations), and finally examine an optimization problem with multiple simultaneous aggregation queries.
Smooth interfaces for spectral element method for the solution of incompressible Newtonian fluid flow
Authors: Sha Meng, Xin Kai Li, Ronaldo Mercado
Venue: The Journal of Supercomputing (2009)

A smoothing technique is developed to calculate the interface conditions of spectral element method for solving the incompressible Newtonian fluid flow. The first derivative at the interface of spectral elements is calculated by using only the adjacent subdomains. Numerical simulations of an incompressible laminar fluid flow through a planar channel and a 2:1 planar contraction channel are presented for various Reynolds numbers.
Foreword for the special issue of selected papers from the 1st ACM SIGSPATIAL Workshop on Security and Privacy in GIS and LBS
Authors: Elisa Bertino, Maria Luisa Damiani
Venue: Transactions on Data Privacy (2009)

The first Workshop on Security and Privacy in GIS and LBS (SPRINGL 2008) was organized on November 4, 2008 at Irvine (CA) in conjunction with the SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2008). The goal of the SPRINGL workshop series is to provide a forum for researchers working in the area of geospatial data security and privacy. Both security and privacy are critical for geospatial applications because of the dramatic increase and dissemination of geospatial data in several application contexts including homeland security, environmental crises, and natural and industrial disasters. Furthermore, geospatial infrastructures are being leveraged by companies to provide a large variety of location-based services (LBS) able to tailor services to users. However, despite the increase of publicly accessible geospatial information only little attention is being paid to how to secure geospatial information systems (GIS) and LBS. Privacy is also of increasing concern given the sensitivity of personally-identifiable location information. This is despite major advancements that have been made in secure computing infrastructures and the secure and privacy-preserving management of traditional (relational) data in particular. The discussion at the workshop spanned across security and privacy aspects, as they relate to the management of geospatial data and to the development of emerging LBS. The present special issue of Transactions on Data Privacy contains four extended papers, focusing on privacy, that have been selected from the papers presented at SPRINGL 2008.
New means of cybernetics, informatics, computer engineering, and systems analysis
Authors: V. I. Levin
Venue: Cybernetics and Systems Analysis (2009)

The class of combinatorial problems equivalent to the problem of determination of relative positions of n interval sequences is formulated. It is shown that an adequate mathematical model of solving a stated problem is a finite dynamic memoryless automaton and that the adequate mathematical apparatus is continuous logic. Algorithms that solve the problem are constructed.
Software component recommendation using collaborative filtering
Authors: Makoto Ichii, Yasuhiro Hayase, Reishi Yokomori, Tetsuo Yamamoto, Katsuro Inoue
Venue: Proceedings of the 2009 ICSE Workshop on Search-Driven Development-Users, Infrastructure, Tools and Evaluation (2009)

Software component retrieval systems are widely used to retrieve reusable software components. This paper proposes recommendation system integrated into software component retrieval system based on collaborative filtering. Our system uses browsing history to recommend relevant components to users. We also conducted a case study using programming tasks and found that our system enables users to efficiently retrieve reusable components.
Delay-dependent robust stability analysis of uncertain stochastic neural networks with discrete interval and distributed time-varying delays
Authors: P. Balasubramaniam, R. Rakkiyappan
Venue: Neurocomputing (2009)

This paper is concerned with stability analysis problem for uncertain stochastic neural networks with discrete interval and distributed time-varying delays. The parameter uncertainties are assumed to be norm bounded and the delay is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. Based on the new Lyapunov-Krasovskii functional and stochastic stability theory, delay-interval dependent stability criteria are obtained in terms of linear matrix inequalities. Some numerical examples and comparisons are provided to show that the proposed results significantly improve the allowable upper and lower bounds of delays over some existing results in the literature. Furthermore, the supplementary requirement that the time derivative of discrete time-varying delays must be smaller than the value one is not necessary to derive the results in this paper.
Self-directed Learning in Technology Supported Project Work
Authors: Allan H. K. Yuen, Liping Deng
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Based on the analysis of 83 case studies developed in the Module 2 of the Second International Information Technology in Education Study (SITES), project work was found to be the most popular format of pedagogical innovation. A careful examination of the project descriptions revealed that the 34 cases of project work could be further distinguished into five approaches: research project, thematic project, study trip, discussion project, and aggregated-task project. With one case chosen from each category as the focus, this paper attempts to examine technology supported project work from the perspective of self-directed learning. We seek to reveal how project work is related to self-directed learning and how technology helps the teaching and learning process.
Minimum vertex guard problem for orthogonal polygons: a genetic approach
Authors: Antonio L. Bajuelos, Santiago Canales, Gregorio Hernández, Ana Mafalda Martins
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The problem of minimizing the number of guards placed on vertices needed to guard a given simple polygon (MINIMUM VERTEX GUARD problem) is NP-hard. This computational complexity opens two lines of in vestigation: the development of algorithms that determine approximate solutions and the determination of optimal solutions for special classes of simple polygons. In this paper we follow the first line of investigation proposing an approximation algorithm based on the general metaheuristic Genetic Algorithms to solve the MINIMUM VERTEX GUARD problem.
A Framework for Predicting Person-Effort on Requirements Changes
Authors: Bee Bee Chua, June M. Verner, Darren Dalcher
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

Requirements changes are normally reviewed by change control committees, who examine costs and consider consequences of additions, deletions and modifications to a piece of software. In order to predict the person effort required for a change, it is important to understand the reasons for the change as the nature of a change is characterized by its attributes which may be inherited and may be internal or external. The activities involved in supplying information for, and approving a requirements change can be time-consuming and complicated. As a result, there is a need to understand the relationships between requirements change characteristics and their attributes, and the level of effort. This paper presents a framework designed to address requirements change relationships. Our approach uses content analysis to study existing change control forms, and a detailed literature review. The contributions of this paper are two fold; firstly, we wish to improve the process of reviewing and approving requirements changes by change management committees. Secondly, we wish to assist project managers in better planning for requirements changes through more accurate prediction of person-effort required for a requirements change.
A conceptual design and demonstration for an e-care system
Authors: C. C. Li, Y. S. Shiao, Chin E. Lin, C. C. Li, C. J. Sun
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

This paper presents a system concept design and demonstration for e-care application to connect patients' physical data into doctors' personal computer for remote consultancy. An e-Care System is focused on chronic and geriatric patients for their physical data sensing and remote monitoring, as well as other care applications. Based on adopting mobile communication, data acquisition is connecting onto doctor's computer in real time via Internet access. System configuration is proposed and designed. Case studies on asthma and heart chronic data are tested and reported under location-based monitor implementation.
Time Series Clustering for Anomaly Detection Using Competitive Neural Networks
Authors: Guilherme A. Barreto, Leonardo Aguayo
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

In this paper we evaluate competitive learning algorithms in the task of identifying anomalous patterns in time series data. The methodology consists in computing decision thresholds from the distribution of quantization errors produced by normal training data. These thresholds are then used for classifying incoming data samples as normal/abnormal. For this purpose, we carry out performance comparisons among five competitive neural networks (SOM, Kangas' Model, TKM, RSOM and Fuzzy ART) on simulated and real-world time series data.
Facial feature extraction method based on coefficients of variances
Authors: Feng-Xi Song, David Zhang, Cai-Kou Chen, Jing-Yu Yang
Venue: Journal of Computer Science and Technology (2007)

Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) are two popular feature extraction techniques in statistical pattern recognition field. Due to small sample size problem LDA cannot be directly applied to appearance-based face recognition tasks. As a consequence, a lot of LDA-based facial feature extraction techniques are proposed to deal with the problem one after the other. Nullspace Method is one of the most effective methods among them. The Nullspace Method tries to find a set of discriminant vectors which maximize the between-class scatter in the null space of the within-class scatter matrix. The calculation of its discriminant vectors will involve performing singular value decomposition on a high-dimensional matrix. It is generally memory- and time-consuming. Borrowing the key idea in Nullspace method and the concept of coefficient of variance in statistical analysis we present a novel facial feature extraction method, i.e., Discriminant based on Coefficient of Variance (DCV) in this paper. Experimental results performed on the FERET and AR face image databases demonstrate that DCV is a promising technique in comparison with Eigenfaces, Nullspace Method, and other state-of-the-art facial feature extraction methods.
Error-Tolerant Data Mining
Authors: Xindong Wu
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Data mining seeks to discover novel and actionable knowledge hidden in the data. As dealing with large, noisy data is a defining characteristic for data mining, where the noise in a data source comes from, whether the noisy items are randomly generated (called random noise) or they comply with some types of generative models (called systematic noise), and how we use these data errors to boost the succeeding mining process and generate better results, are all important and challenging issues that existing data mining algorithms can not yet directly solve. Consequently, systematic research efforts in bridging the gap between the data errors and the available mining algorithms are needed to provide an accurate understanding of the underlying data and to produce enhanced mining results for imperfect, real-world information sources. This talk presents our recent investigations on bridging the data and knowledge gap in mining noisy information sources.
Complexity of wavelength assignment in optical network optimization
Authors: Matthew Andrews, Lisa Zhang
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We study the complexity of a set of design problems for optical networks. Under wavelength division multiplexing (WDM) technology, demands sharing a common fiber are transported on distinct wavelengths. Multiple fibers may be deployed on a physical link. Our basic goal is to design networks of minimum cost, minimum congestion and maximum throughput. This translates to three variants in the design objectives: 1) MIN-SUMFIBER: minimizing the total cost of fibers deployed to carry all demands; 2) MIN-MAXFIBER: minimizing the maximum number of fibers per link to carry all demands; and 3) MAX-THROUGHPUT: maximizing the carried demands using a given set of fibers. We also have two variants in the design constraints: 1) CHOOSEROUTE: Here we need to specify both a routing path and a wavelength for each demand; 2) FIXEDROUTE: Here we are given demand routes and we need to specify wavelengths only. The FIXEDROUTE variant allows us to study wavelength assignment in isolation. Combining these variants, we have six design problems. Previously we have shown that general instances of the problems MIN-SUMFIBER-CHOOSEROUTE and MIN-MAXFIBER-FIXEDROUTE have no constant-approximation algorithms. In this paper, we prove that a similar statement holds for all four other problems. Our main result shows that MIN-SUMFIBER-FIXEDROUTE cannot be approximated within any constant factor unless NP-hard problems have efficient algorithms. This, together with the previous hardness result of MIN-MAXFIBER-FIXEDROUTE, shows that the problem of wavelength assignment is inherently hard by itself. We also study the complexity of problems that arise when multiple demands can be time-multiplexed onto a single wavelength (as in time-domain wavelength interleaved networking (TWIN) networks) and when wavelength converters can be placed along the path of a demand.
Development of an e-Learning Resource for Teacher Education Utilizing a VOD-compatible Teaching Portfolio Having a Dual-screen Synchronous Playback Function
Authors: Hitoshi Miyata
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

We have developed a teaching improvement support system utilizing a web-based teaching portfolio provided with a VOD-compatible animated video clip function. This system has been used by active teachers since last year. This teaching portfolio has recently been given a dual-screen synchronous playback function for video clips of classes, and has been distributed as an e-learning resource to enable students to observe classes prior to practical teacher training. As a result, in comparison with video clips on a single screen, this dual-screen synchronous playback has been suggested as being effective as an instructional resource since there are differences in the manner in which students perceive the three points consisting of the sense of presence of classroom observation, understanding the reactions of students in response to questions from the instructor, and understanding the preferences and interests of students.
The impact of teacher interaction on the achievement and self-efficacy of students within a computer-based, developmental mathematics course
Authors: Anna O. Graeber, James T. Fey
Venue:  (2008)

A concern of our nation's universities and colleges is the number of students entering with what are considered to be sub-standard mathematics skills. According to the National Center for Education Statistics (NCES, 2001), in the fall of 2000, 24% of entering freshmen in 4-year institutions, and 53% of entering freshmen at 2-year institutions were enrolled in a developmental mathematics course.Since developmental educators are increasing their use of technology to "re-teach" this population of students, understanding the role of the instructor in such a setting can inform developmental educators about the needs of the students, thereby potentially increasing the success rate in such courses. Success in developmental mathematics courses could lead to an increase in college-level retention rates and increase students&rsquo; learning and achievement in credit-bearing mathematics courses.The purpose of this study was to examine if teacher initiated interaction with developmental mathematics students studying in a computer-based classroom has an effect on their achievement or self-efficacy in mathematics. The study seeks to explore whether the role the instructor assumes is a factor in student success. Many theorists and researchers believe that teacher-student interaction and support/motivation provided by teachers are critical to students&rsquo; mathematical achievement.Through the use of a quantitative, experimental design, the researcher attempted to gain insight into the role of a developmental mathematics teacher, the achievement of students enrolled in a computerized class, as well as their feelings of self-efficacy toward mathematics. Six sections of an existing computer-based developmental mathematics course was the setting at a four-year research university in the mid-Atlantic area. The treatment provided by the teacher included: conducting brief initial interviews to obtain background information; initiating interaction and encouragement in every session; monitoring student progress; setting intermediate goals; e-mailing about absences; and verbalizing feedback on tests.The repeated measure ANOVA results of this study indicated that there were significant improvements in student achievement, confidence, and attitude toward teacher when pre- and post- scores were compared in both the control and treatment group. However, no statistically significant difference occurred in achievement or self-efficacy when the classes were analyzed between groups; treatment group vs. control group.
Simultaneous non-linear retrieval of atmospheric profiles and surface skin temperature from MODIS infrared radiances in Taiwan Strait
Authors: Qiang Zhao, Shizhi Yang, Yanli Qiao, Jinji Ma
Venue: International Journal of Remote Sensing (2009)

A non-linear iterative physical algorithm that simultaneously retrieves atmospheric temperature, water vapour distribution and surface skin temperature from Moderate Resolution Imaging Spectroradiometer (MODIS) longwave infrared radiances is presented. The retrieval algorithm uses clear-sky radiances measured by MODIS in Taiwan Strait for both day and night, and shows that it is capable of retrieving medium-scale atmospheric temperature and water vapour. Sea surface temperature is retrieved with an accuracy similar to that achieved by MOD07 products. Evaluation of retrieval total precipitable water vapour (TPW) is performed by comparisons with retrievals from MOD07 products and data from a ground-based sunphotometer. These show that MODIS retrieval of TPW, in general, agrees with other sounder retrievals of TPW. The total totals index (TTI) distribution retrieved from MODIS data is similar to that from MOD07 products.