ppxscal/embedding_network huggingface dataset:
The considerable elements of the emotion expression using lights in apparel types
Authors: Yongsoon Choi, Juyong Kim, Peter Pan, Jihong Jeung
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

When types of communication between people are observed, one can see that communication not only consist of words but also, contextual communication consist of facial expressions and body gestures. In this study, elements that needs to be considered when using light in clothes in order to express the thoughts and various emotions of the wearer and surrounding people and to design contextual interaction rather than simply for visual effects, are examined. Clothes and light are central visual elements theerfore, the relationship between perception of objects through sight and emotions are examined, elements of visual language of cloths and light are examined through documentary record, elements of visual language such as shape, color, and texture of light and clothes that influence each other are classified as well as unique elements of visual elements of light such as blink speed and blink pattern, and terms that are related to the psychological effects of these elements are extracted. Based on this, using the 8 most representative human emotions which includes happiness, excitement, anger, hatred, sadness, shock, fear, and shame as standards of design, interaction design elements using clothes and light for expression of each emotion are organized in a matrix. Then, scenarios and ideas are generated, and based on the Matrix, interaction concept design in which expression of emotions and information possible using light in apparel are produced.
Novelty and diversity in information retrieval evaluation
Authors: Charles L.A. Clarke, Maheedhar Kolla, Gordon V. Cormack, Olga Vechtomova, Azin Ashkan, Stefan Büttcher, Ian MacKinnon
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Evaluation measures act as objective functions to be optimized by information retrieval systems. Such objective functions must accurately reflect user requirements, particularly when tuning IR systems and learning ranking functions. Ambiguity in queries and redundancy in retrieved documents are poorly reflected by current evaluation measures. In this paper, we present a framework for evaluation that systematically rewards novelty and diversity. We develop this framework into a specific evaluation measure, based on cumulative gain. We demonstrate the feasibility of our approach using a test collection based on the TREC question answering track.
Checking race freedom via linear programming
Authors: Tachio Terauchi
Venue: ACM SIGPLAN Notices (2008)

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs.
Deformation Design Technology of Dental Restoration Model
Authors: Ning Dai, Xiao-Sheng Cheng, Wen-He Liao, Qing Yu, Yong Wang, Pei-Jun Lü, Quan-Ping Sun
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Dental CAD/CAM offers the prospects of drastically reducing the time to provide service to patients. The design of tooth model’ surface is one of the key steps of dental CAD/CAM. This paper presents a novel method based on the subdivision space deformation to realize the tooth local deformation. The association mapping between the tooth model and the subdivision space is constructed during the local parameterization stage. During the local design process, the feature control mesh simplified from the initial mesh is modified by the user and then the modification is transferred to the subdivision space with Loop subdivision. The tooth model is changed according to the deformation of subdivision space. Some examples are tested in this work and the results demonstrate that the proposed algorithm is effective and feasible.
The development of a credit scoring system: a CBR approach with GA applied
Authors: Shihchieh Chou, Doug Sheu, Tai-Ping Hsing, Patric S. Chen
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

To improve the classifying accuracy for credit rating, many techniques have been applied in the credit scoring methods. This research has developed a credit scoring system based on case-based reasoning (CBR) with the genetic algorithm (GA) applied in the k-nearest-neighbor (k-NN) technique for case retrieving. Performance of the system has been presented and examined under human selected factors. Also, advamced research with the same techniques applied to support loan amount rating has been designed and suggested.
Supporting multimedia streaming and best-effort data transmission over IEEE 802.11e EDCA
Authors: Wen-Kuang Kuo
Venue: International Journal of Network Management (2008)

As demand for broadband multimedia wireless services increases, improving quality of service (QoS) of the widely deployed IEEE 802.11 wireless LAN (WLAN) has become crucial. To support the QoS required by a wide range of applications, the IEEE 802.11 working group has defined a new standard: IEEE 802.11e. In this paper, we propose a measurement-based dynamic media time allocation (MBDMTA) scheme combined with a concatenating window scheme to support real-time variable bit rate (rt-VBR) video and best-effort (BE) data transmission using IEEE 802.11e enhanced distributed channel access (EDCA). To provide the QoS guarantee for rt-VBR video, the proposed MBDMTA scheme dynamically assigns channel time to the rt-VBR video based on the estimate of the required network resources. On the other hand, the concatenating window scheme controls the contention window (CW) ranges of different priority flows such that real-time services always have higher channel access probability, thus achieving the capability of preemptive priorities. In addition, the concatenating window scheme preserves fairness among flows of the same class and attains high channel utilization under different network conditions. Simulation results demonstrate that the throughput and delay performance improve significantly for the transmission of rt-VBR video and BE traffic as compared to those for the 802.11e EDCA specification. It is also revealed that combining the two proposed schemes provides seamless integration and reliable transmission of digital video and data service within the 802.11e EDCA framework.
On hardness of learning intersection of two halfspaces
Authors: Subhash Khot, Rishi Saket
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We show that unless NP = RP, it is hard to (even) weakly PAC-learn intersection of two halfspaces in Rn using a hypothesis which is a function of up to l linear threshold functions for any integer l. Specifically, we show that for every integer l and an arbitrarily small constant ε > 0, unless NP = RP, no polynomial time algorithm can distinguish whether there is an intersection of two halfspaces that correctly classifies a given set of labeled points in Rn, or whether any function of l linear threshold functions can correctly classify at most 1/2+ε fraction of the points.
PROJECT TEAM SELECTION USING FUZZY OPTIMIZATION APPROACH
Authors: Adil Baykasoglu, Turkay Dereli, Sena Das
Venue: Cybernetics and Systems (2007)

With their high potential, high motivation, great problem-solving ability and flexibility, project teams are important work structures for the business life. The success of these teams is highly dependent upon the people involved in the project team. This makes the project team selection an important factor for project success. The project team selection can be defined as selecting the right team members, which will together perform a particular project/task within a given deadline. In this article, an analytical model for the project team selection problem is proposed by considering several human and nonhuman factors. Because of the imprecise nature of the problem, fuzzy concepts like triangular fuzzy numbers and linguistic variables are used. The proposed model is a fuzzy multiple objective optimization model with fuzzy objectives and crisp constraints. The skill suitability of each team candidate is reflected to the model by suitability values. These values are obtained by using the fuzzy ratings method. The suitability values of the candidates and the size of the each project team are modeled as fuzzy objectives. The proposed algorithm takes into account the time and the budget limitations of each project and interpersonal relations between the team candidates. These issues are modeled as hard-crisp constraints. The proposed model uses fuzzy objectives and crisp constraints to select the most suitable team members to form the best possible team for a given project. A simulated annealing algorithm is developed to solve the proposed fuzzy optimization model. Software based on C + + computer programming language is also developed to experiment on the proposed model in forming project teams.
Infeasibility of instance compression and succinct PCPs for NP
Authors: Lance Fortnow, Rahul Santhanam
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

The OR-SAT problem asks, given Boolean formulae Φ1,...,Φm each of size at most n, whether at least one of the Φi's is satisfiable. We show that there is no reduction from OR-SAT to any set A where the length of the output is bounded by a polynomial in n, unless NP ⊆ coNP/poly, and the Polynomial-Time Hierarchy collapses. This result settles an open problem proposed by Bodlaender et. al. [4] and Harnik and Naor [15] and has a number of implications. A number of parametric $\NP$ problems, including Satisfiability, Clique, Dominating Set and Integer Programming, are not instance compressible or polynomially kernelizable unless NP ⊆ coNP/poly. Satisfiability does not have PCPs of size polynomial in the number of variables unless NP ⊆ coNP/poly. An approach of Harnik and Naor to constructing collision-resistant hash functions from one-way functions is unlikely to be viable in its present form. (Buhrman-Hitchcock) There are no subexponential-size hard sets for NP unless NP is in co-NP/poly. We also study probabilistic variants of compression, and show various results about and connections between these variants. To this end, we introduce a new strong derandomization hypothesis, the Oracle Derandomization Hypothesis, and discuss how it relates to traditional derandomization assumptions.
Matrices of 3-iet preserving morphisms
Authors: P. Ambro, Z. Masáková, E. Pelantová
Venue: Theoretical Computer Science (2008)

We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving Sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid {M@?N^2^x^2|detM=+/-1}={M@?N^2^x^2|MEM^T=+/-E}, where E=(01-10). We prove that in the case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid {M@?N^3^x^3|MEM^T=+/-E,detM=+/-1}, where E=(011-101-1-10).
BlackBerry Quick Reference Guide 7200, 7500, 7700 series
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference card showing step-by-step instructions and shortcuts for how to use the BlackBerry. This card is for models 7210, 7230, 7280, 7290, 7510, 7730, 7750, and 7780. The following topics are covered: Powering On, Turning On or Off Screen Backlight, Powering Off Manually, Navigating Screens and Menus, Charging the Handheld, Turning Off Wireless, Setting Auto Power Off, Setting Backlight Timeout, Setting Owner Information, Setting Handheld Password, Locking the Handheld Manually, Working with Text, Copying or Cutting Text, Accessing Your Contacts, Finding a Contact, Adding a Contact, Contacting a Person (Email, Phone, SMS), Deleting a Contact, Memo or Email, Answering a Phone Call, Adjusting Speaker Volume, Muting your Microphone, Ending a Phone Call, Placing a Call to a New Number, Adjusting Ringer and Alarm Volume, Accessing your Calendar, Disabling Quick Entry, Changing the Calendar View, Jumping to a Particular Date, Jumping to Today, Creating a New Calendar Entry, Editing a Calendar Entry, Responding to an Alarm, Accessing your Memos, Creating a New Memo, Viewing a Memo, Creating a New Email, Replying to an Email, Starting the Internet Web Browser, Visiting a Bookmarked Site, Visiting a New Web Site, Navigating Web Pages, Adding a Page to your Bookmarks, and Backing up Your Handheld Data. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
A Customer Satisfaction Degree Evaluation Model Based on Support Vector Machine
Authors: Wang Ting, Hua Zhiwu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

An efficient classification algorithm is proposed for evaluating the customer satisfaction degree. The algorithm is based on the RBF-Kernel support vector machine and multilevel binary tree classifier. Fuzzy membership function was used to quantify the evaluation indices. The evaluation indices and the SVM algorithm were used to design a customer satisfaction degree evaluation model. The novel evaluation method has higher accuracy in comparison with the traditional fuzzy comprehensive evaluation method and BP evaluation method.
Using Body Sensor Networks for Increased Safety in Bomb Disposal Missions
Authors: John Kemp, Elena I. Gaura, James Brusey, C. Douglas Thake
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Bomb disposal manned missions are inherently safety-critical. Wireless Sensor Network (WSN) technology potentially offers an opportunity to increase the safety of the operatives involved in such missions through detailed physiological parameters monitoring and fusion of "health" information. Wearing heavy armour during bomb disposal manned missions may have side effects that, due to reduction of the body's ability to regulate core temperature in the enclosed environment of the suit, lead to uncompensable heat stress and thus impair the technician's physical or mental ability. Experimental trials have shown no obvious relationship between temperature of any single skin site and the core temperature nor between single point temperature and subjective thermal sensation (usually associated with comfort). Also, core temperature alone may not yield indicators of danger sufficiently early. This paper proposes to integrate a body network of temperature sensors into the bomb disposal suit. The paper describes an in-network sensor data fusion and modelling approach that estimates the overall thermal sensation for the suit wearer, in real time, based on the multi-point temperature data. The case is made for performing the modelling in-network on the basis of reducing communications with the remote mission control point and to better support actuation of an in-suit cooling system. It is also argued that thermal sensation indicators are more useful to present at an on-line remote monitoring station than individual temperatures. The appropriateness of the developed Body Sensor Network (BSN) application is supported by experimental validation.
Sensorless low/zero speed control of induction motors with EKF estimation
Authors: Murat Barut, Seta Bogosyan, Metin Gokasan
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

This study aims an improved estimation performance for the speed sensorless control of induction motors (IMs) over a very low/zero speed range. For this purpose, an Extended Kalman Filter (EKF) observer is designed to overcome the difficulties of flux/speed estimation at and around zero speed. The estimation problems related to low speed operation are further emphasized due to stator resistance, Rs uncertainties. Thus, the observer is designed to estimate the stator resistance, load torque and velocity, which is taken into account via the equation of motion. With this approach, the rotor flux information is reflected to the stator, thus improving the estimation accuracy. The simulation results obtained for the EKF approach in combination with the Direct Vector Control (DVC) of an IM, indicate improved performance.
Optimized Implementation of Ray Tracing on Cell Broadband Engine
Authors: Bo Li, Hai Jin, Zhiyuan Shao, Yong Li, Xin Liu
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Ray tracing is a global illumination based on rendering method. It could produce very high-quality image. But rendering is also a very time-consuming procedure. In this paper, we map a Whitted-style recursive ray tracing on Cell Broadband Engine processor (Cell BE) with a number of optimization techniques according to the architecture characteristics of Cell BE processor, which include adaptive task scheduling, software managed cache, double buffering, packets of primary rays through SIMD unit. Through experiments, we show our implementation can harness the Cell BE processing power to up-limit.
On combining temporal scaling and quality scaling for streaming MPEG
Authors: Huahui Wu, Mark Claypool, Robert Kinicki
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Temporal Scaling and Quality Scaling are both widely-used techniques to reduce the bitrate of streaming video. However, combinations and comparisons of Temporal and Quality Scaling have not been systematically studied. This research extends previous work to provide a model for combining Temporal and Quality Scaling, and uses an optimization algorithm to provide a systematic analysis of their combination over a range of network conditions and video content. Analytic experiments show: 1) Quality Scaling typically performs better than Temporal Scaling, with performance differences correlated with the motion characteristics of the video. In fact, when the network capacity is moderate and the loss rate is low, Quality Scaling performs nearly as well as the optimal combination of Quality and Temporal Scaling; 2) when the network capacity is low and the packet loss rate is high, Quality Scaling alone is ineffective, but a combination of Quality and Temporal Scaling can provide reasonable video quality; 3) adjusting the amount of Forward Error Correction (FEC) provides significantly better performance than video streaming without FEC or video streaming with a fixed amount of FEC.
Exact GPS simulation and optimal fair scheduling with logarithmic complexity
Authors: Paolo Valente
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Generalized Processor Sharing (GPS) is a fluid scheduling policy providing perfect fairness over both constant-rate and variable-rate links. The minimum deviation (lead/lag) with respect to the GPS service achievable by a packet scheduler is one maximum packet size. To the best of our knowledge, the only packet scheduler guaranteeing the minimum deviation is Worst-case Fair Weighted Fair Queueing (WF2Q), which requires on-line GPS simulation. Existing algorithms to perform GPS simulation have O(N) worst-case computational complexity per packet transmission (N being the number of competing flows). Hence, WF2Q has been charged for O(N) complexity too. However it has been proven that the lower bound complexity to guarantee O(1) deviation is Ω(log N), yet a scheduler achieving such a result has remained elusive so far. In this paper, we present L-GPS, an algorithm that performs exact GPS simulation with O(log N) worst-case complexity and small constants. As such it improves the complexity of all the packet schedulers based on GPS simulation. We also present L-WF2Q, an implementation of WF2Q based on L-GPS. L-WF2Q has O(log N) complexity with small constants, and, since it achieves the minimum possible deviation, it does match the aforementioned complexity lower bound. Furthermore, both L-GPS and L-WF2Q comply with constant-rate as well as variable-rate links. We assess the effectiveness of both algorithms by simulating real-world scenarios.
The Case for Quantitative Process Management
Authors: Bill Curtis, Girish V. Seshagiri, Donald Reifer, Iraj Hirmanpour, Gargi Keeni
Venue: IEEE Software (2008)

This article introduces a special section on "Embedding Statistical Methods into Software Engineering Practices." It provides a background on Quantitative Process Management and makes the case for why these methods are important. It presents an example of how a model can be developed to predict project outcomes by using data emerging from the performance of process tasks. It discusses how these methods can be used with different software development paradigms. It ends by summarizing develops needed in five different communities in order for these methods to be widely adopted.
Scenario-based teaching and technology in mathematics education
Authors: Mufid Abudiab
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

I have been engaged in a variety of curricular reform programs that deals with developmental mathematics, calculus, business mathematics, and differential equations. These curricular reform programs address interactive tools, technology, and a variety of real life applications and needs of different areas that are served by mathematics. Traditionally, mathematics courses introduce the basic skills and needed mathematical concepts followed by some applications related to a certain field of study. In this paper, I share my experience in using a variety of curricular reform programs that are scenario -based, and supported by multimedia and technology. I will demonstrate the new material and technology, discuss the challenges and rewards of teaching using these programs, and convey my role of introducing some of these courses to the university core curriculum program.
Semantic Web-Oriented Intelligent Information Retrieval System
Authors: Wenjie Li, Xiaohuan Zhang, Xiaofei Wei
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The notion of ontology is introduced to information retrieval systems and semantic Web-oriented architecture of personalized intelligent information retrieval system is presented, and hierarchical tree model of local domain ontological repository of biomedical diseases system is constructed, in which the OWL language is used to detail annotate syntax and semantics of concepts, their attributes and relations among the concepts. Automatic acquirement of remote information on the Internet and pretreatment of local domain ontological repository are implemented by inference rules and information semantics-based intelligent clustering algorithm in the architecture, and preference database of doctors are managed logically according to their retrieval interests. Consequently, the system will meets the requirement of personalized intelligent information search for diseases diagnosis, and further improves recall and precision of information retrieval on biomedical diseases system.