ppxscal/embedding_network huggingface dataset:
A computer-aided change detection system for paediatric acute intracranial haemorrhage
Authors: Boyu Hao, Carson Kai-Sang Leung, Sergio Camorlinga, Martin H. Reed, Martin K. Bunge, Jens Wrogemann, Rick J. Higgins
Venue: Proceedings of the 2008 C3S2E conference (2008)

In this paper, we apply computer science and software engineering techniques in, and bring benefits to, real-life applications. Specifically, we propose a design for a computeraided change detection system, which uses both image processing and data mining techniques, to help clinicians diagnose bleeding in children's brains---i.e., in medical terms, paediatric acute intracranial haemorrhage (AIH). The proposed system provides clinicians with computerized analysis of medical images in the form of computed tomography (CT) scans of the heads of children patients. This, in turn, leads to more efficient detection, diagnosis, and progress evaluation of paediatric AIH.
Exact learning via the Monotone theory
Authors: N. H. Bshouty
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We study the learnability of concept classes from membership and equivalence queries. We develop the Monotone theory that proves (1) Any boolean function is learnable as decision tree. (2) Any boolean function is either learnable as DNF or as CNF (or both). The first result solves the open problem of the learnability of decision trees and the second result gives more evidence that DNFs are not "very hard" to learn.
Dynamic Cache Invalidation Scheme in IR-Based Wireless Environments
Authors: Yeim-Kuan Chang, I-Wei Ting, Tai-Hong Lin
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Traditional cache invalidation schemes are not suitable to be employed in wireless environments due to the affections of mobility, energy consumption, and limited bandwidth. Cache invalidation report (IR) is proposed to deal with the cache consistency problem. However, the main drawback of IR-based schemes is the long latency of data access because the mobile hosts (MHs) need to wait next IR interval for cache invalidation when the cache hit happens. In this paper, we propose a Dynamic Invalidation Report (DIR) to reduce the latency of data access when the MHs query data. DIR contains an early cache validation mechanism by utilizing the validation messages. Therefore, the MHs can verify their cached data as soon as possible. Next, we design a predictive method to dynamically adjust IR interval to further reduce the latency called DIR-AI (DIR with Adjustable Interval) scheme. Finally, we evaluate the performance of the DIR and DIR-AI and compare them with the existing invalidation report schemes by using NS2 (Network Simulator). The experimental results show that DIR reduces averagely 54.3% and 34.3% of latency; DIR-AI reduces averagely 57.35 and 38.6% of latency compared with TS (TimeStamp) and UIR (Updated IR) schemes respectively.
Demonstration of a Wireless Sensor Network for Real-Time Indoor Localisation and Motion Monitoring
Authors: Lasse Klingbeil, Tim Wark
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

This paper describes our demonstration of a wireless sensor network for monitoring human motion and position in an indoor environment. Mobile sensor nodes comprising mote-type devices, along with inertial sensors are worn by persons moving inside buildings. Motion data is preprocessed onboard mobile nodes and transferred to a static network of seed nodes using a delay tolerant protocol with minimal radio packet overhead. A Monte Carlo based localisation algorithm is implemented, which uses a person's pedometry data, indoor map information and seed node positions to provide accurate, real-time indoor location information.
Stability of transductive regression algorithms
Authors: Corinna Cortes, Mehryar Mohri, Dmitry Pechyony, Ashish Rastogi
Venue: Proceedings of the 25th international conference on Machine learning (2008)

This paper uses the notion of algorithmic stability to derive novel generalization bounds for several families of transductive regression algorithms, both by using convexity and closed-form solutions. Our analysis helps compare the stability of these algorithms. It suggests that several existing algorithms might not be stable but prescribes a technique to make them stable. It also reports the results of experiments with local transductive regression demonstrating the benefit of our stability bounds for model selection, in particular for determining the radius of the local neighborhood used by the algorithm.
Lifetime analysis of the logical topology constructed by homogeneous topology control in wireless mobile networks
Authors: A. Nayebi, H. Sarbazi-Azad
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Topology control protocols construct a logical topology out of the physical communication graph. Logical topology is maintained by logical neighbor lists in every node. Logical topology is used by several upper-layer protocols as a substantial communication map and is prone to link breakages due to node mobility which compels the periodic re-execution of the topology control protocol in so called &#x201C;Hello&#x201D; intervals. The problem addressed in this paper is determining the maximum &#x201C;Hello&#x201D; interval preserving the connectivity with high probability which is not extensively concerned yet. The simplest form of topology control, homogeneous topology control, is chosen for start. Two connectivity requirements and statistical topology lifetime (STL) are defined. Then, temporal properties of the topology are studied in terms of STL analysis. Finally, an estimation method for evaluation of STL is proposed and based on the method the STL of several scenarios is estimated. The results are compared to the results of extensive simulations which confirm the accuracy of the proposed method.
Optimization of poly-di-methyl-siloxane (PDMS) substrates for studying cellular adhesion and motility
Authors: D. Fuard, T. Tzvetkova-Chevolleau, S. Decossas, P. Tracqui, P. Schiavone
Venue: Microelectronic Engineering (2008)

The cellular adhesion and motility have direct implications in the tumoral-metastatic cells development or in the tissue engineering mechanisms for instance. Our work aims at knowing the impact of substrate mechanical properties on those adhesion and motility mechanisms by modifying bulk rigidity, surface energy and composition of a bio-compatible poly-di-methyl-siloxane (PDMS) substrate. We show how a wide range of PDMS rigidity can be obtained and how Ar/O"2-based plasmas turn PDMS surface to hydrophilic. A correlation between surface energy, bulk rigidity, cells adhesion and growth is finally shown.
Multi-geocast Algorithms for Wireless Sparse or Dense Ad Hoc Sensor Networks
Authors: Nassima Hadid, Jean Frédéric Myoupo
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Multi-Geocasting in wireless sensor network and Ad Hoc network is the delivery of packets from a source (or sink) to all the nodes located in several geographic areas. The objectives of a multi-geocasting protocol are guaranteed message delivery and low transmission cost. All the existing protocols guarantee delivery only in dense networks. In this paper, we present two multi-geocast protocols which guarantee delivery of the packets whatever is the density of the sensor network (dense or sparse). They are also suitable for networks with irregular distributions with gaps or obstacles.
A graph method for keyword-based selection of the top-K databases
Authors: Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, Anthony K. H. Tung
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to perform effective retrieval. Since these requirements pose a problem to lay or occasional users, several methods incorporate keyword search (KS) into relational databases. However, most of the existing techniques focus on querying a single DBMS. On the other hand, the proliferation of distributed databases in several conventional and emerging applications necessitates the support for keyword-based data sharing and querying over multiple DMBSs. In order to avoid the high cost of searching in numerous, potentially irrelevant, databases in such systems, we propose G-KS, a novel method for selecting the top-K candidates based on their potential to contain results for a given query. G-KSsummarizes each database by a keyword relationship graph, where nodes represent terms and edges describe relationships between them. Keyword relationship graphs are utilized for computing the similarity between each database and a KS query, so that, during query processing, only the most promising databases are searched. An extensive experimental evaluation demonstrates that G-KS outperforms the current state-of-the-art technique on all aspects, including precision, recall, efficiency, space overhead and flexibility of accommodating different semantics.
Optical lithography onto inside surfaces of small-diameter pipes
Authors: Toshiyuki Horiuchi, Masahiro Katayama, Yuusuke Watanabe, Katsuyuki Fujita, Takashi Yasuda
Venue: Microelectronic Engineering (2008)

Lithography onto inside surfaces of small-diameter pipes was investigated. Two types of exposure rod for inserting into the pipes were developed. One has a chip of light emitting diode (LED) at the rod end, and the other transmits the exposure light through an optical fiber. In the latter case, LED was used as a source, too. Aluminum pipes with an inner diameter of 5mm were coated with a positive resist PMER P-AR900. The resist thickness was controlled to be approximately 10@mm, and the pipes were exposed to the light beam from the inserted exposure rods. The exposure light beams were narrowed using handmade pinholes with hole-sizes of 170@mm and 100@mm. Patterns were delineated rotating and moving the pipes. As a result, space patterns with a width of less than 200@mm were printed. Not only simple linear patterns but also helicoids and character patterns were successfully printed. The novel ''inside lithography'' is feasible and will be useful for carving various fine grooves onto the inside surfaces of small-diameter pipes and cylinders.
Optimizing scientific application loops on stream processors
Authors: Li Wang, Xuejun Yang, Jingling Xue, Yu Deng, Xiaobo Yan, Tao Tang, Quan Hoang Nguyen
Venue: ACM SIGPLAN Notices (2008)

This paper describes a graph coloring compiler framework to allocate on-chip SRF(Stream Register File) storage for optimizing scientific applications on stream processors. Our framework consists of first applying enabling optimizations such as loop unrolling to expose stream reuse and opportunities for maximizing parallelism, i.e., overlapping kernel execution and memory transfers.Then the three SRF management tasks are solved in a unified manner via graph coloring: (1) placing streams in the SRF, (2) exploiting stream use, and (3) maximizing parallelism. We evaluate the performance of our compiler framework by actually running nine representative scientific computing kernels on our FT64 stream processor. Our preliminary results show that compiler management achieves an average speedup of 2.3x compared to First-Fit allocation. In comparison with the performance results obtained from running these benchmarks on Itanium 2, an average speedup of 2.1x is observed.
Computational Prediction of UV-responsible MicroRNA Genes in Vitis vinifera Genome
Authors: Zhen-lin Wei, Chun-zhen Jiao, Zhi-huan Tian, Ling Dong
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

In this paper, we predicted UV-responding microRNAs in wine grape genome by homolog search based computational approach. We successfully predicted 13 grape microRMAs from total 16 queryAth-microRNAs. The MiPred software prediction results, the stem-loop structure feature analysis and pol II promoter prediction results showed that these 13 putative microRNAs are maybe true plant microRNAs. Several unknown UV-responding transcript factor binding motifs were identified in these 13 promoter regions. We predicated some types of transcription factor are potential targets of those MicroRNAs,including CCAAT-binding transcription factor, GRAS family transcription factor and myb-related transcription factor, 3 members of vv-mirRNA159b putative targets have reverse transcriptase and integratase activity.
Effects of avatar's blinking animation on person impressions
Authors: Kazuki Takashima, Yasuko Omori, Yoshiharu Yoshimoto, Yuich Itoh, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of graphics interface 2008 (2008)

Blinking is one of the most important cues for forming person impressions. We focus on the eye blinking rate of avatars and investigate its effect on viewer subjective impressions. Two experiments are conducted. The stimulus avatars included humans with generic reality (male and female), cartoon-style humans (male and female), animals, and unidentified life forms that were presented as a 20-second animation with various blink rates: 9, 12, 18, 24 and 36 blinks/min. Subjects rated their impressions of the presented stimulus avatars on a seven-point semantic differential scale. The results showed a significant effect of the avatar's blinking on viewer impressions and it was larger with the human-style avatars than the others. The results also lead to several implications and guidelines for the design of avatar representation. Blink animation of 18 blinks/min with a human-style avatar produces the friendliest impression. The higher blink rates, i.e., 36 blinks/min, give inactive impressions while the lower blink rates, i.e., 9 blinks/min, give intelligent impressions. Through these results, guidelines are derived for managing attractiveness of avatar by changing the avatar's blinking rate.
Report on the Sixth ACM Workshop on Privacy in the Electronic Society (WPES 2007)
Authors: Adam J. Lee, Ting Yu
Venue: ACM SIGMOD Record (2008)

The world is transforming into an electronic society where almost every aspect of our lives is increasingly computerized and interconnected. Such a transformation has profoundly changed the scope, the scale and the level of automation for information collection, storage, analysis and dissemination. It, on the one hand, has and continues to enable new and better services. On the other hand, it inevitably increases the degree of privacy concerns.
The effect of a computer-based cartooning tool on children's cartoons and written stories
Authors: M. Madden, P. W. H. Chung, C. W. Dawson
Venue: Computers Education (2008)

This paper reports a study assessing a new computer tool for cartoon storytelling, created by the authors for a target audience in the upper half of the English and Welsh Key Stage 2 (years 5 and 6, covering ages 9-11 years). The tool attempts to provide users with more opportunities for expressive visualisation than previous educational software; its design was motivated by earlier work connecting ''moving image literacy'' with print literacy, and it was used here in storywriting preparation work: users first visualised a known story, then wrote their versions of it based on the cartoons they had made. The stories produced are compared with stories written using two other preparation activities, one a pencil-and-paper cartooning exercise and the other a teacher's normal planning session, which also resulted in a retelling of a known story. The study finds that no one preparation process had a noticeably different effect on the final written stories; however, the cartoons produced with the software are found to be quite different to their paper counterparts, showing a greater variety of character action, pose and interaction, slightly more variety of camera shot distance, and more pictures. Children's and teachers' reactions to the software tool are also discussed.
Noise Interaction Between Power Distribution Grids and Substrate
Authors: Daniel A. Andersson, Simon Kristiansson, Lars J. Svensson, Per Larsson-Edefors, Kjell O. Jeppson
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

We have investigated the interaction between power delivery and substrate coupling in terms of noise. From our results, we identify that an increased density of substrate contacts does not to any significance decrease noise on the power supply lines. However, the current injected into the substrate is highly dependent on higher-level grid/package inductance and substrate contact density. We have derived statistically that substrate noise variations could be related to these two design parameters to 69.75%. Based on linear fitting, a model that describes the injected current as function of substrate contact density and power delivery inductance is developed.
A Hafnium interlayer method to improve the thermal stability of NiSi film
Authors: Xiong-wei Yue, Li-chun Zhang, Yu-zhi Gao, Hai-yan Jin
Venue: Microelectronic Engineering (2008)

The effect of a thin Hafnium interlayer on the thermal stability of NiSi film has been investigated. Both X-ray diffraction and Raman spectra show that no high resistivity NiSi"2 appears in the Hf-additioned films which were post-annealed at temperatures ranging from 600^oC to 800^oC. Auger electron spectroscopy and Rutherford back scattering show that the Hf interlayer has moved to the top of the film after rapid thermal annealing, working as the diffusion barrier for upper Ni atoms. The three-dimensional surface morphology by atom force microscopy shows that the agglomeration of NiSi is effectively suppressed, which is attributed to the barrier effect of the Hf interlayer. The fabricated Ni(Hf)Si/Si Schottky diodes still displays good current-voltage characteristics even after annealed at temperatures varied from 650^oC to 800^oC, which further show that the Hf interlayer can improve the thermal stability of NiSi.
Improvement of a Fingerprint-Based Remote User Authentication Scheme
Authors: Jing Xu, Wen-Tao Zhu, Deng-Guo Feng
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Password authentication has been adopted as one of the most commonly used solutions in network environments to protect resources from unauthorized access. Recently, Khan et al. proposed an efficient fingerprint-based remote user authentication scheme with smart cards, in which a password/verification table is not required on the remote server, and users are allowed to choose and update their passwords freely. In this paper, we show that their scheme is vulnerable to the parallel session attack. Furthermore, their scheme is susceptible to the impersonation attack provided that the information stored in the smart card is disclosed by an adversary. We also propose an improved scheme which is immune to the presented attacks.
A consistency architecture for hierarchical shared caches
Authors: Edya Ladan-Mozes, Charles E. Leiserson
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Hierarchical Cache Consistency (HCC) is a scalable cache-consistency architecture for chip multiprocessors in which caches are shared hierarchically. HCC's cache-consistency protocol is embedded in the message-routing network that interconnects the caches, providing a distributed and scalable alternative to bus-based and directory-based consistency mechanisms. The HCC consistency protocol is "progressive" in that every message makes monotonic progress without timeouts, retries, negative acknowledgments, or retreating in any way. The latency is at most proportional to the diameter of the network. For HCC with a binary fat-tree network, the protocol requires at most 13 bits of additional state per cache line, no matter how large the system. We prove that the HCC protocol is deadlock free and provides sequential consistency.
On efficient top-k query processing in highly distributed environments
Authors: Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Michalis Vazirgiannis
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most interesting data objects. A challenging problem is to support rank-aware queries in highly distributed environments. In this paper, we present a novel approach, called SPEERTO, for top-k query processing in large-scale peer-to-peer networks, where the dataset is horizontally distributed over the peers. Towards this goal, we explore the applicability of the skyline operator for efficiently routing top-k queries in a large super-peer network. Relying on a thresholding scheme, SPEERTO returns the exact results progressively to the user, while the number of queried super-peers and transferred data is minimized. Finally, we propose different variations of SPEERTO that allow balancing between transferred data volume and response time. Through simulations we demonstrate the feasibility of our approach.
Improving student performance using automated testing of simulated digital logic circuits
Authors: Zachary Kurmas
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

JLSCircuitTester helps automate the testing and grading of circuits built using digital logic simulators. With many simulators, the testing and grading of circuits is tedious and time consuming enough that students do not test their circuits thoroughly. JLSCircuitTester addresses this problem by simplifying the means by which users specify sets of input and expected output values. In addition, it automatically verifies that the circuit under test produces the correct output. The projects submitted during the pilot semester contained approximately half as many errors as the previous semester's projects. The automatic evaluation has also simplified the grading of those projects.
Delay in a Discrete-Time Queueing Model with Batch Arrivals and Batch Services
Authors: Dieter Claeys, Koenraad Laevens, Joris Walraevens, Herwig Bruneel
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

During the past decades batch-service queueing models have been studied extensively, especially with regard to the system content. Some researchers have studied the distribution of the customer delay, but not in the case of batch arrivals, which is a non-trivial extension. In this paper, we compute the probability generating function of the delay in a discrete-time batch-service queueing model with batch arrivals and single-slot service times. We make extensive use of residue theory. It is further shown that moments of the delay can be derived from the obtained probability generating function.
Free-Form Annotation Tool for Collaboration
Authors: Han-Zhen Wu, Stephen J. H. Yang, Yu-Sheng Su
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

The people often establish taking notes on reading and browsing activities; hence annotation is being very important in human life in anytime and anywhere. We developed a free-form annotation tool for collaboration that provides a convenient way to create annotation easily. Our approach is characterized by two design criteria, including: 1) digital Ink annotation: help users to focus on annotated concept or specified sentence on reading and browsing a web page; 2) IM-based annotation discussion board: help users to discuss sharing digital Ink annotation based on each one's aspect in an efficient manner.