ppxscal/embedding_network huggingface dataset:
Development of i-appli for Women's Health Information Management System
Authors: Takehiro Kanno, Wenxi Chen, Masumi Kitazawa
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The purpose of this paper is to develop a mobile phone application for women's health monitoring and information management. This mobile phone application is targeted on FOMA900 series mobile phones released by NTT DoCoMo and known as i-appli. A wearable temperature logger device is used to measure body surface temperature during sleep automatically. Collected temperature data are transmitted to a specific database server via mobile phone. These data are used to calculate women's menstrual cycle, estimate next ovulation period, and supply self healthcare services. This i-appli realized many innovative features, such as "My Stage", "Oral Care", "My Diary" and so forth, based on the above system for women daily healthcare. Twenty-two women tried out the i-appli for two months. The result from a questionnaire survey showed that most of the trial users feel comfortable and informative in helping their daily health care and information management.
Lower-Level Estimation and Interpretation of Visual Motion
Authors: W. B. Thompson
Venue: Computer (1981)

A promising spectrum of low-level approaches to visual motion faces serious obstacles: deficiencies in accuracy and efficiency, limited understanding of interpretation processes, and the correspondence problem.
Error inequalities for an optimal quadrature formula
Authors: Nenad Ujević
Venue: Journal of Applied Mathematics and Computing (2007)

An optimal 3-point quadrature formula of closed type is derived. It is shown that the optimal quadrature formula has a better error bound than the well-known Simpson's rule. A corrected formula is also considered. Various error inequalities for these formulas are established. Applications in numerical integration are given.
A unified framework for max-min and min-max fairness with applications
Authors: Bozidar Radunović, Jean-Yves Le Boudec
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide applicability, there are still examples, arising in the context of wireless or peer-to-peer networks, where the existing theories do not seem to apply directly. In this paper, we give a unifying treatment of max-min fairness, which encompasses all existing results in a simplifying framework, and extend its applicability to new examples. First, we observe that the existence of max-min fairness is actually a geometric property of the set of feasible allocations. There exist sets on which max-min fairness does not exist, and we describe a large class of sets on which a max-min fair allo cation does exist. This class contains, but is not limited to the compact, convex sets of RN. Second, we give a general purpose centralized algorithm, called Max-min Programming, for computing the max-min fair allocation in all cases where it exists (whether the set of feasible allocations is in our class or not). Its complexity is of the order of N linear programming steps in RN, in the case where the feasible set is defined by linear constraints. We show that, if the set of feasible allocations has the free disposal property, then Max-min Programming reduces to a simpler algorithm, called Water Filling, whose complexity is much lower. Free disposal corresponds to the cases where a bottleneck argument can be made, andWater Filling is the general form of all previously known centralized algorithms for such cases. All our results apply mutatis mutandis to min-max fairness. Our results apply to weighted, unweighted and util-max-min and min-max fairness. Distributed algorithms for the computation of max-min fair allocations are outside the scope of this paper.
Study on Feature Extraction in China Railway Ticketing and Reservation System
Authors: Xiaoyan Lui, Chunhuang Liu, Weiwei Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Because that data analysis methods for train ticket data are mostly designed for building predictive analysis models, which are always good at describing the characteristics of major classes but are lack of reflecting the minorities, this paper presents a new method FEBIR that is based on the set-partition for data feature extraction. The presented method can distill the pointed favorite class features without the limitations of current analysis methods in characterizing the minors. The characteristic rules which are extracted by this method include quantitative information, and the order of attributes in the rules reflects how importantly they contribute to sculpture the class, so it provides enough information for decision-makers to analyze the special class and will be an effective tool for railway managers to get useful information about their focuses. Key words: data mining, FEBIR, decision tree, China ticketing and reservation system (TRS)
Application of Artificial Neural Network to Distributed Precipitation Estimation Based on EOS/MODIS Remotely Sensed Imagery
Authors: Qiuwen Zhang, Cheng Wang, Zhong Liu, Fumio Shinohara, Tatsuo Yamaoka
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

With the meteorological factors extracted from EOS/MODIS satellite remotely sensed imagery and the corresponding observed precipitation being the input layer and output layer respectively, a Back Propagation(BP) Artificial Neural Network(ANN) is learned and trained. As the test and application, the distributed precipitations in Qingjiang river basin located in central China are estimated. It is concluded that the precipitations estimated by the BP ANN based on EOS/MODIS are nearly equal to the observed ones at the rainfall stations distributed in the river basin. It is revealed that the integration of EOS/MODIS and ANN provides a new effective way to estimate the distributed precipitation in river basin.
Stability Analysis for T-S Fuzzy Discrete-Time Systems with Multiple Time-Varying Delays
Authors: Wei Xie, Toshio Eisaka
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, stability analysis for T-S fuzzy discrete-time systems with multiple time-varying delays is studied. Main results are given in terms of linear matrix inequalities which provide efficient numerical methods to analyze stability conditions of the systems.
DRAMA: A framework for domain requirements analysis and modeling architectures in software product lines
Authors: Jintae Kim, Sooyong Park, Vijayan Sugumaran
Venue: Journal of Systems and Software (2008)

One of the benefits of software product line approach is to improve time-to-market. The changes in market needs cause software requirements to be flexible in product lines. Whenever software requirements are changed, software architecture should be evolved to correspond with them. Therefore, domain architecture should be designed based on domain requirements. It is essential that there is traceability between requirements and architecture, and that the structure of architecture is derived from quality requirements. The purpose of this paper is to provide a framework for modeling domain architecture based on domain requirements within product lines. In particular, we focus on the traceable relationship between requirements and architectural structures. Our framework consists of processes, methods, and a supporting tool. It uses four basic concepts, namely, goal based domain requirements analysis, Analytical Hierarchy Process, Matrix technique, and architecture styles. Our approach is illustrated using HIS (Home Integration System) product line. Finally, industrial examples are used to validate DRAMA.
Mapping adaptation under evolving schemas
Authors: Yannis Velegrakis, Renée J. Miller, Lucian Popa
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

To achieve interoperability, modern information systems and e-commerce applications use mappings to translate data from one representation to another. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities. Such changes must be reflected in the mappings. Mappings left inconsistent by a schema change have to be detected and updated. As large, complicated schemas become more prevalent, and as data is reused in more applications, manually maintaining mappings (even simple mappings like view definitions) is becoming impractical. We present a novel framework and a tool (ToMAS) for automatically adapting mappings as schemas evolve. Our approach considers not only local changes to a schema, but also changes that may affect and transform many components of a schema. We consider a comprehensive class of mappings for relational and XML schemas with choice types and (nested) constraints. Our algorithm detects mappings affected by a structural or constraint change and generates all the rewritings that are consistent with the semantics of the mapped schemas. Our approach explicitly models mapping choices made by a user and maintains these choices, whenever possible, as the schemas and mappings evolve. We describe an implementation of a mapping management and adaptation tool based on these ideas and compare it with a mapping generation tool.
Fuzzy Cognitive Maps in modeling supervisory control systems
Authors: Chrysostomos D. Stylios, Peter P. Groumpos
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper investigates a hybrid methodology that combines fuzzy logic and neural networks, Fuzzy Cognitive Map (FCM), for modeling and controlling Supervisory Control Systems. A mathematical description of Fuzzy Cognitive Maps (FCM) will be presented and new construction methods will be extensively examined. A Fuzzy Cognitive Map will be developed to model and control a process example and the Supervisor-FCM model characteristics will be discussed. There is a going need for more autonomous and intelligent systems, especially in Complex Systems area, the application of Fuzzy Cognitive Maps for modeling the Supervisor may contribute to develop more sophisticated systems.
Detection of incomplete ellipse in images with strong noise by iterative randomized Hough transform (IRHT)
Authors: Wei Lu, Jinglu Tan
Venue: Pattern Recognition (2008)

An iterative randomized Hough transform (IRHT) is developed for detection of incomplete ellipses in images with strong noise. The IRHT iteratively applies the randomized Hough transform (RHT) to a region of interest in the image space. The region of interest is determined from the latest estimation of ellipse parameters. The IRHT ''zooms in'' on the target curve by iterative parameter adjustments and reciprocating use of the image and parameter spaces. During the iteration process, noise pixels are gradually excluded from the region of interest, and the estimation becomes progressively close to the target. The IRHT retains the advantages of RHT of high parameter resolution, computational simplicity and small storage while overcoming the noise susceptibility of RHT. Indivisible, multiple instances of ellipse can be sequentially detected. The IRHT was first tested for ellipse detection with synthesized images. It was then applied to fetal head detection in medical ultrasound images. The results demonstrate that the IRHT is a robust and efficient ellipse detection method for real-world applications.
COMIS: Cooperative Methodology for Information Systems
Authors: Maria de los Angeles Arenas, Jose L. Caro, Antonio Guevara, Jose L. Leiva
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

This paper proposes a cooperative methodology for IS development, focusing on the end user's collaboration in the process, providing the training and tools required to obtain the characteristics of the processes in which he/she is involved and actively integrating the user in the IS development team. Each of the steps involved in IS development is coordinated by a Meta-CASE tool based on a Workflow Management System (WfMS).
B72-11 An Introduction to Switching System Design
Authors: L. L. Kinney
Venue: IEEE Transactions on Computers (1972)

The authors have written an introductory textbook on switching algebra and its application to logic system design. The book contains almost no formal mathematical presentation and, hence, is quite easy to read. The level of the presentation could easily be handled by third-year undergraduate students. (The authors state that the material is suitable for approximately a one-semester course, but do not specify an intended level.) No background in switching algebra is assumed or required. At various points throughout the textbook, some of the practical aspects of logic system design are mentioned and the impractical aspects of the material are pointed out where appropriate. The method of presentation and the orientation will appeal to students with an engineering background, but students with a strong mathematical bent will not be as interested.
Multi-objective Optimization in Partner Selection
Authors: Xuesen Ma, Jianghong Han, Zhengfeng Hou, Zhenchun Wei
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

It is a typical multi-objective optimization problem for the scientific decision of bidding to seek cooperating partner in virtual enterprise. With the optimization model proposed, partner selection is solved by the improved genetic algorithm. In the evolution process, individual survive rate is dynamic according to queue of individuals' fitness values before roulette wheel selection, avoiding premature convergence. Crossover and mutation operators are accordingly adaptive to fitness value and iterative degree, which endows individuals with self-adaptability with the variation of the environment. Finally, the example demonstrates the validity of the adaptive genetic algorithm.
A multi-part lab exercise for analyzing the effect of peer-to-peer software on a university network
Authors: Brandon Wagner, Stephen Renshaw, Kent Broadbent
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Over the past few years, university campuses have dealt with peer-to-peer software and its usage on their network. While it is easy to see the bandwidth consumption this software uses, other affects on hardware and software have not been adequately studied or taught. Many networking-based classes do not include specific instructional labs that adequately explain what peer-to-peer traffic looks like, what affects it has on a network, and in what ways networks can be designed to handle it better. Through a multi-part lab, students will learn how to create and program Java and MySQL-based applications to monitor the health of a network. This monitoring will include recording CPU, memory, and packet statistics from switches, routers, and firewalls. Additional information can be collected from intrusion protection devices, packet shapers, and content engines if devices are available. Through analysis of the recorded data, students will learn to recognize CPU and memory usage patterns. Additional packet investigating will be used with network protocol analyzing software such as Wireshark. As each step in the lab is completed, students will learn how to appropriately monitor a network using programs they have created. Skills obtained through this lab include better understanding of SNMP; switch, router, and firewall command line configuration; and packet size, type, and analysis. Students will also discover system administration through self-created applications. This analysis and discovery is best understood through studying Layers 2 through 4 of the OSI model. The data collected will indicate how switches (Layer 2), routing (Layer 3), and TCP/UDP packet types (Layer 4) are affected by peer-to-peer software.
Reversible sketches: enabling monitoring and analysis over high-speed data streams
Authors: Robert Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive which can be extended to construct many aggregate queries. The recently proposed sketches are among the very few that can detect heavy changes online for high speed links, and thus support various aggregate queries in both temporal and spatial domains. However, it does not preserve the keys (e. g., source IP address) of flows, making it difficult to reconstruct the desired set of anomalous keys. To address this challenge, we propose the reversible sketch data structure along with reverse hashing algorithms to infer the keys of culprit flows. There are two phases. The first operates online, recording the packet stream in a compact representation with negligible extra memory and few extra memory accesses. Our prototype single FPGA board implementation can achieve a throughput of over 16 Gb/s for 40-byte packet streams (the worst case). The second phase identifies heavy changes and their keys from the representation in nearly real time. We evaluate our scheme using traces from large edge routers with OC-12 or higher links. Both the analytical and experimental results show that we are able to achieve online traffic monitoring and accurate change/intrusion detection over massive data streams on high speed links, all in a manner that scales to large key space size. To the best of our knowledge, our system is the first to achieve these properties simultaneously.
Text Retrieval Computers
Authors: L. A. Hollaar
Venue: Computer (1979)

The hardware required for efficient text retrieval differs from that required for retrieval of formatted data. Here is an examination of such hardware, particularly term comparators.
A Lightweight Grid Middleware Based on OPENSSH - SCE
Authors: Zhihui Dai, Lingjiang Wu, Haili Xiao, Hong Wu, Xuebin Chi
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Grid computing becomes more and more popular in high performance computing, major science communities now accept that Grid technology is important for their future. Our super computing center has a set of scientific projects which need grid computing technology and environment. In this paper, we introduce an under research grid middleware SCE (Scientific computing environment) for the scientific super computing service environment. It is mainly based on the OPENSSH software package, adopts the Open Grid Services Architecture (OGSA) and defines its resource by the Web Service Resource Framework (WSRF) specification. It is a service based middleware. The paper not only gives an introduction to the main framework of the SCE but also gives the details of the implementation of the four main services defined by OGSA, grid security, job management, data management and information service.
Measuring up: how to keep security metrics useful and realistic
Authors: Shari Lawrence Pfleeger
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

Software quality measurement has a long and not always happy history. Eager to measure many aspects of software quality, researchers sometimes have measured what was expedient or available instead of what was useful and realistic. In this talk, Shari Lawrence Pfleeger reviews software quality measurement, pointing out lessons that can be applied to current attempts to measure the security of systems and networks. She offers guidelines for effective security measurement that take into account not only the technology but also the business context in which the measurement is done.
Brief paper: A generalized KYP lemma based approach for disturbance rejection in data storage systems
Authors: Chunling Du, Lihua Xie, Guoxiao Guo, Jul Nee Teoh
Venue: Automatica (Journal of IFAC) (2007)

This paper is concerned with disturbance rejection for data storage systems which applies microactuator to expand its servo bandwidth. An approach based on the generalized Kalman-Yakubovic-Popov (KYP) lemma together with the Youla parameterization is proposed which allows us to suppress disturbances of particular frequencies within or beyond the servo bandwidth via convex optimization. The rejection of narrowband high-frequency disturbances is achieved by using this approach. Simulation together with implementation results demonstrate the simplicity and effectiveness of the design method as compared with the traditional frequency weighting method.
Performance comparisons of load balancing algorithms for I/O-intensive workloads on clusters
Authors: Xiao Qin
Venue: Journal of Network and Computer Applications (2008)

Load balancing techniques play a critically important role in developing high-performance cluster computing platforms. Existing load balancing approaches are concerned with the effective usage of CPU and memory resources. Due to imbalance in disk I/O resources under I/O-intensive workloads, the previous CPU- or memory-aware load balancing schemes suffer significant performance drop. To remedy this deficiency, in this paper we propose a novel load-balancing algorithm (hereinafter referred to as IOLB) for clusters, which aims at maintaining high resource utilization under a wide range of workload conditions. Specifically, IOLB is conducive to reducing the average slowdown of all parallel jobs submitted to a cluster by balancing load in disk resources. This can, in turn, not only achieve the effective usage of global disk resources but also reduce response times of I/O-intensive parallel jobs. To theoretically study the optimization of the IOLB algorithm, we qualitatively comparing IOLB with two conventional CPU- and memory-aware load-balancing schemes. We prove that when the workloads become CPU- or memory-intensive in nature, IOLB gracefully degrades towards the existing load-balancing schemes. Experimental results based on trace-driven simulations demonstratively show that the IOLB algorithm significantly improves the resource utilization of a cluster under I/O-intensive workloads. Furthermore, our results confirm that IOLB is able to maintain the same level of performance as the two existing approaches, because IOLB improves CPU and memory utilization under CPU- and memory-intensive workloads.