ppxscal/embedding_network huggingface dataset:
The Relation of Paddy Rice Canopy Spectrum Reflectivity and the Leaf Moisture Content in the Different Nitrogen Condition
Authors: Jun Sun, Jinjuan Liu, Hanping Mao, Bing Lu
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The paddy rice canopy spectrum at a critical growth period is obtained by the use of ASD spectrometer. The relationship of leaf water ratio and canopy spectrum reflectivity in the different nitrogen condition is analyzed. The results showed that the relevance of the paddy rice canopy spectrum reflectivity and the leaf moisture content is less under the environment of lack of nitrogen. The correlation of canopy spectrum reflectivity of waveband between 736nm and 1350nm and leaf moisture content is up to above 0.7 under the environment of right nitrogen amount. The correlation of canopy spectrum reflectivity of waveband between 730nm and 1300nm and leaf moisture content is above 0.5 under the environment of excessive nitrogen. The sensitive bands corresponding to paddy rice moisture content are selected, and the ratio vegetation indexes of different growth stages are analyzed. We can find that, at the heading stage, the relevance of R1000/R740 ratio and the moisture content of leaves is best without the influence of nitrogen fertilizer processing. A regression model is set up and the correlation coefficient reached 0.89, and the standard error is 0.0197.
Recycle Your Arrays!
Authors: Roman Leshchinskiy
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforestation frameworks such as stream fusion achieve signficant improvements here but fail for a number of important operations which can nevertheless benefit from elimination of temporaries. To mitigate this problem, we extend stream fusion with support for in-place execution of array operations. This optimisation, which we call recycling, is easy to implement and can significantly reduce array allocation and copying in purely functional array algorithms.
Generalized Jacobi polynomials/functions and their applications
Authors: Ben-Yu Guo, Jie Shen, Li-Lian Wang
Venue: Applied Numerical Mathematics (2009)

We introduce a family of generalized Jacobi polynomials/functions with indexes @a,@b@?R which are mutually orthogonal with respect to the corresponding Jacobi weights and which inherit selected important properties of the classical Jacobi polynomials. We establish their basic approximation properties in suitably weighted Sobolev spaces. As an example of their applications, we show that the generalized Jacobi polynomials/functions, with indexes corresponding to the number of homogeneous boundary conditions in a given partial differential equation, are the natural basis functions for the spectral approximation of this partial differential equation. Moreover, the use of generalized Jacobi polynomials/functions leads to much simplified analysis, more precise error estimates and well conditioned algorithms.
Sensitivity Analysis and Optimization Algorithm —– Based on Nonlinear Programming —–
Authors: Masayoshi Oda, Yoshihiro Yamagami, Junji Kawata, Yoshifumi Nishio, Akio Ushida
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We propose here a fully Spice-oriented design algorithm of op-amps for attaining the maximum gains under low power consumptions and assigned slew-rates. Our optimization algorithm is based on a well-known steepest descent method combining with nonlinear programming. The algorithm is realized by equivalent RC circuits with ABMs (analog behavior models) of Spice. The gradient direction is decided by the analysis of sensitivity circuits. The optimum parameters can be found at the equilibrium point in the transient response of the RC circuit. Although the optimization time is much faster than the other design tools, the results might be rough because of the simple transistor models. If much better parameter values are required, they can be improved with Spice simulator and/or other tools.
Towards a pattern language for aspect-based design
Authors: Maarten Bynens, Wouter Joosen
Venue: Proceedings of the 1st workshop on Linking aspect technology and evolution (2009)

With the maturation and widespread adoption of AOSD comes the need for patterns and best practices to solve recurring problems. Such patterns have been documented in different publications. Besides a conclusive catalog, a system to relate the patterns and drive the process of pattern selection would bear significant benefits. In this position paper, we designate the road towards a pattern language for aspect-based design and describe the initial steps.
Psychiatric document retrieval using a discourse-aware model
Authors: Liang-Chih Yu, Chung-Hsien Wu, Fong-Lin Jang
Venue: Artificial Intelligence (2009)

With the increased incidence of depression-related disorders, many psychiatric websites have been developed to provide huge amounts of educational documents along with rich self-help information. Psychiatric document retrieval aims to assist individuals to locate documents relevant to their depressive problems efficiently and effectively. By referring to relevant documents, individuals can understand how to alleviate their depression-related symptoms according to recommendations from health professionals. This work proposes the use of high-level discourse information extracted from queries and documents to improve the precision of retrieval results. The discourse information adopted herein includes negative life events, depressive symptoms and semantic relations between symptoms, which are beneficial for better understanding of users' queries. Experimental results show that the discourse-aware retrieval model achieves higher precision than the word-based retrieval models, namely the vector space model (VSM) and Okapi model, adopting word-level information alone.
A Fuzzy Evaluation Approach for Bridge Based on Domain Knowledge
Authors: Ming Chen
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Bridge condition assessment is usually conducted by bridge inspectors on the basis of visual inspections. This inevitably involves human being’s subjective judgments and uncertainties. This paper presents a novel approach for developing a performance evaluation system for existing bridges. The system evaluates the performance of bridges under deterioration on the basis of domain knowledge. Characteristic features of this study are the determination of weight based on domain knowledge. A hypothetical case shows that the proposed evaluation approach offers a flexible and effective way of rating bridge conditions.
Timed verification of the generic architecture of a memory circuit using parametric timed automata
Authors: Remy Chevallier, Emmanuelle Encrenaz-Tiphene, Laurent Fribourg, Weiwen Xu
Venue: Formal Methods in System Design (2009)

Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we analyse some crucial timing behaviors of the architecture of SPSMALL memory, a commercial product of STMicroelectronics. Using the model of parametric timed automata and model checker HYTECH, we formally derive a set of linear constraints that ensure the correctness of the response times of the memory. We are also able to infer the constraints characterizing the optimal setup timings of input signals. We have checked, for two different implementations of this architecture, that the values given by our model match remarkably with the values obtained by the designer through electrical simulation.
Collective knowledge: contextual dependency for querying location based services
Authors: S. Gabriel González, Rafael Ponce-Medellín, R. Rodolfo Pazos, Jorge Ruiz-Vanoye, R. Azucena Montes, Hugo Estrada
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Information search presents the necessity to provide the most according and pertinent content to requests and a growing need to provide it in a more personalized way, based on the spatial-temporal situation of the users, especially when querying about geolocalizable places. Recently the use of geolocalizable information has taken a huge relevance, as can be observed in the apparition of a variety of Web map services and mashups; however, there are still latent research needs for the retrieval of the most relevant, popular and context dependant results for a geolocalizable places user's query. This paper presents a briefly overview for the current state of the art about the use and approaches for geographic information, contextual dependency about it and the social approach that can be taken for its use; later, the use of a contextual impact factor to determine the contextual relevance inside an Information retrieval system is presented, which considers relevant and retrieved elements, also taking into account the collective knowledge gained through the social Web participation.
Law and technologyThe network neutrality debate hits Europe
Authors: Pierre Larouche
Venue: Communications of the ACM (2009)

Differences in telecommunications regulation between the U.S. and the European Union are a key factor in viewing the network neutrality discussion from a European perspective.
A methodology for preference-based personalization of contextual data
Authors: Antonio Miele, Elisa Quintarelli, Letizia Tanca
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

The widespread use of mobile appliances, with limitations in terms of storage, power, and connectivity capability, requires to minimize the amount of data to be loaded on user's devices, in order to quickly select only the information that is really relevant for the users in their current contexts: in such a scenario, specific methodologies and techniques focused on data reduction must be applied. We propose an extension to the data tailoring approach of Context-ADDICT, whose aim is to dynamically hook and integrate heterogeneous data to be stored on small, possibly mobile devices. The main goal of our extension is to personalize the context-dependent data obtained by means of the Context-ADDICT methodology, by allowing the user to express preferences that specify which data s/he is more interested in (and which not) in each specific context. This step allows us to impose a partial order among the data, and to load only the top (most preferred) portion of the data chunks. A running example is used to better illustrate the approach.
GNU Octave Manual Version 3
Authors: John W Eaton, David Bateman, Soren Hauberg
Venue:  (2008)

This manual is the definitive guide to GNU Octave, an interactive environment for numerical computation. GNU Octave provides a convenient command-line interface for solving linear and nonlinear problems using vectors and matrices. This updated edition of the manual covers version 3 of GNU Octave, and includes documentation for new features such as sparse matrices, linear programming and computational geometry.GNU Octave is free software, distributed under the GNU General Public License (GPL). All the money raised from the sale of this book supports the development of free software. For each copy sold $1 will be donated to the GNU Octave Development Fund.About the authors: John W. Eaton is the original developer of GNU Octave.
Energy budget approximations for battery-powered systems with a fixed schedule of active intervals
Authors: Daler Rakhmatov
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

The amount of available energy is a critical limitation of battery-powered electronic systems. The classic design goal is to minimize system energy consumption subject to performance constraints. An alternative objective would be to maximize performance under energy constraints, which requires a method for computing the energy budget corresponding to a certain battery lifetime. This paper presents such a method for systems with a fixed schedule of active intervals. Our method computes the energy budget for each active interval and guarantees that the battery survives until the end of the schedule. We rely on an accurate analytical battery model that takes into account nonlinear changes in the battery voltage, capacity loss at high discharge rates, charge recovery, and capacity fade over time. As the battery model is computationally expensive, we also present efficient approximations for computing the upper and lower bounds on the energy budget for each active interval. The main limitation of this work is our assumption that the battery current is the same for all active intervals.
Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks
Authors: Li Li, Bin Qin, Chunyuan Zhang
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

Due to missing copyright, this chapter was removed from the online version of this volume.
Geographic relevance in mobile services
Authors: Tumasch Reichenbacher
Venue: Proceedings of the 2nd International Workshop on Location and the Web (2009)

In this position paper we describe the concept of geographic relevance and its potential for mobile location-based services employing the mobile Internet. We argue that existing LBS have a too limited concept of location and its application for filtering geographic content. We propose an approach for geographic relevance that extends LBS and location-aware web applications and aims at better supporting mobile users' decision-making based on geographic information. After a short description of an ongoing project we discuss the different roles of location and the different conceptions of space that can be involved in assessing and representing geographic relevance. Finally we provide a few concluding statements that aim at stimulating a cross-disciplinary discussion about location and its importance for relevance.
Approximation algorithm for maximum edge coloring
Authors: Wangsen Feng, Liang Zhang, Hanpin Wang
Venue: Theoretical Computer Science (2009)

We propose a polynomial time approximation algorithm for a novel maximum edge coloring problem which arises from wireless mesh networks [Ashish Raniwala, Tzi-cker Chiueh, Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network, in: INFOCOM 2005, pp. 2223-2234; Ashish Raniwala, Kartik Gopalan, Tzi-cker Chiueh, Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks, Mobile Comput. Commun. Rev. 8 (2) (2004) 50-65]. The problem is to color all the edges in a graph with maximum number of colors under the following q-Constraint: for every vertex in the graph, all the edges incident to it are colored with no more than q (q@?Z,q>=2) colors. We show that the algorithm is a 2-approximation for the case q=2 and a (1+4q-23q^2-5q+2)-approximation for the case q>2 respectively. The case q=2 is of great importance in practice. For complete graphs and trees, polynomial time accurate algorithms are found for them when q=2. The approximation algorithm gives a feasible solution to channel assignment in multi-channel wireless mesh networks.
A divide-and-conquer recursive approach for scaling up instance selection algorithms
Authors: Aida Haro-García, Nicolás García-Pedrajas
Venue: Data Mining and Knowledge Discovery (2009)

Instance selection is becoming more and more relevant due to the huge amount of data that is being constantly produced. However, although current algorithms are useful for fairly large datasets, scaling problems are found when the number of instances is of hundreds of thousands or millions. In the best case, these algorithms are of efficiency O(n 2), n being the number of instances. When we face huge problems, scalability is an issue, and most algorithms are not applicable. This paper presents a divide-and-conquer recursive approach to the problem of instance selection for instance based learning for very large problems. Our method divides the original training set into small subsets where the instance selection algorithm is applied. Then the selected instances are rejoined in a new training set and the same procedure, partitioning and application of an instance selection algorithm, is repeated. In this way, our approach is based on the philosophy of divide-and-conquer applied in a recursive manner. The proposed method is able to match, and even improve, for the case of storage reduction, the results of well-known standard algorithms with a very significant reduction of execution time. An extensive comparison in 30 datasets form the UCI Machine Learning Repository shows the usefulness of our method. Additionally, the method is applied to 5 huge datasets with from 300,000 to more than a million instances, with very good results and fast execution time.
Designated verifier proxy signature scheme without random oracles
Authors: Yong Yu, Chunxiang Xu, Xiaosong Zhang, Yongjian Liao
Venue: Computers Mathematics with Applications (2009)

In a designated verifier proxy signature scheme, one can delegate his or her signing capability to another user in such a way that the latter can sign messages on behalf of the former, but the validity of the resulting signatures can only be verified by the designated verifier. Several designated verifier proxy signature schemes have been proposed so far. However, most of the schemes were proven secure in the random oracle model, which has received a lot of criticism since the security proofs in the random oracle model are not sound with respect to the standard model. In this paper, we propose a new construction of designated verifier proxy signature whose security can be proven without using the random oracle model. Our scheme is inspired by Waters' Identity-based encryption. The unforgeability of our scheme is based on the hardness of Gap Bilinear Diffie-Hellman problem. As far as we know, this is the first designated verifier proxy signature secure in the standard model.
Optimization frequency design of eddy current testing
Authors: Narong Mungkung, Komkrit Chomsuwan, Narong Pimpru, Toshifumi Yuji
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The purposes of this research were to construct the nondestructive metal testing intrument by using eddy current method and to find an optimal frequency for the metal testing intrument. The testing instrument consist of a sine wave oscillator circuit which can adjust the frequency between 20-90 kHz, and a 50 ohms sensor circuit. There are three kinds of testing instrument. The first was the nondestructive imperfection testing by using eddy current method. The sample irons are constructed with different imperfection on surface. The output signals of testing from the sensor circuit are compared. The second was the nondestructive categorization metal testing by using eddy current method. Many kinds of metals are taken to testing. The last one was the nondestructive testing for finding the thickness of films on iron by using eddy current method. In this testing the thickness of films varied between 100-700 microns. In all testing, differences of the signal testing were compared to analyze the optimal frequency for the testing intrument. The results of research showed that the nondestructive metal testing intrument by using eddy current method can be used to find a different imperfective iron, categorize the metal and find thickness of films. In addition, the range of an optimal frequency is 30 kHz to 70 kHz for testing intrument.
A Video-Conferencing Distributed Service Tailored for Education
Authors: Patricia Lago, Gianni Canal
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

At present, a lot of initiatives aim at using Internet applications for traditional telecom domains like voice telephony and media on demand. So far, these applica-tions are difficult to integrate in the telecom framework, and are treated rather as separate classes of services. Also, telecom services are traditionally executed in the context of "service sessions", and the software repre-sentation and management of the service session allows to control the service in a rich and flexible way. This paper describes an experiment focused on dis-tance education, which demonstrates the integrability of an Internet commercial application in a distributed object-oriented architecture for telecom services. Also, it demonstrates that by adding session-based service control, Internet applications gain an added value. In detail, it integrated a commercial conferencing appli-cation in a TINA compliant telecom framework, and it extended the application features to support tele teach-ing conference sessions in a flexible and intuitive way.
Evaluating SuperMusic: streaming context-aware mobile music service
Authors: Arto Lehtiniemi
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

The digital music offering and consumption is rapidly increasing and more and more portable devices are offering music listening capabilities. Mobile network bandwidth is also increasing but streaming the music isn't yet common. Most of the mobile music players still rely on locally stored music. They also lack possibilities to request proper music recommendations from online music catalog. This paper presents an evaluation of SuperMusic: prototype streaming context-aware mobile music service. SuperMusic is bringing a large 200 000 track test music catalog available everywhere and including two different music recommendation methods in addition to social interaction of the users. A five week user trial was conducted with 42 users to find out the feasibility of the SuperMusic concept, to find out critical design issues and to evaluate the performance of the music recommendation methods compared to random recommendations. SuperMusic concept satisfied 97% of the users and it was seen as a potential killer application in the music domain with some modifications. The evaluation brings up many suggested design improvements including rebuilding the user interface, improving the streaming of music and the recommendation algorithms, in addition to further enhancing social interaction between the users.
Evaluation of the expressions of robotic emotions of the emotional robot, "Mung"
Authors: Eun Ho Kim, Sonya S. Kwak, Jeonghye Han, Yoon Keun Kwak
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This study verifies the effectiveness of the robotic emotional expressions developed using non-verbal languages. An emotional robot known as "Mung" was developed by applying the nonverbal expressions of bruises (blue or dark blue) and complexions (red or pink) using full color LEDs, to express robotic emotions. With these emotional expressions, Mung functioned as a language purifier by responding to humans' use of language emotionally. In order to evaluate emotional expressions used in Mung, an experiment was performed to compare the robotic emotions using a verbal language with those using non-verbal languages. A 2x2 between-groups factorial design was used for this experiment. The between-groups factors were expression type and emotion type. According to the results of a post-experiment survey, emotional expressions through bruises and complexion are as effective as speech for the delivery of robotic emotions. This result emphasizes the effectiveness of the developed robotic emotional expressions.