ppxscal/embedding_network huggingface dataset:
An Environment Sensor Fusion Application on Smart Building Skins
Authors: Kun-Cheng Tsai, Jing-Tian Sung, Ming-Hui Jin
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This study proposed a smart control algorithm to naturally adjust the thermal quality of the environment according to the interior and exterior environmental factors and the behavior of the inhabitants. To design an appropriate smart control algorithm for the smart buildings in the subtropical zones, this study conscientiously investigated the thermal effect of smart-skin facades of some office buildings in Taiwan to learn the correlation of the thermal parameters and the requirements of the inhabitants. To evaluate and further improve the proposed algorithm, an experimental building with two experimental zones was constructed. The experimental results show that the proposed algorithm significantly improves the thermal comfort and reduce power consumption through well coordinating the smart-skin equipment and air conditioners.
A geographic visualization approach to multi-criteria evaluation of urban quality of life
Authors: Claus Rinner
Venue: International Journal of Geographical Information Science (2007)

This paper proposes to use principles of geographic visualization in conjunction with multi-criteria evaluation methods to support expert-level spatial decision-making. Interactive maps can be combined with analytical tools to explore various settings of multi-criteria evaluation parameters that define different decision-making strategies. In a case study, the analytic hierarchy process (AHP) is used to calculate composite measures of urban quality of life (QoL) for neighbourhoods in Toronto. The AHP allows for an interactive exploration of decision-making strategies, while offering a view on spatial patterns in the evaluation results. In particular, an interactive blending between a classical and a contemporary QoL model is supported. This feature is used in a pilot study to assess the usefulness of geographic visualization in urban QoL evaluation. Three user interviews provide positive feedback on the utility and usability of the tool that was operated by the investigator.
Learning in asynchronous discussion groups: a multilevel approach to study the influence of student, group and task characteristics
Authors: T. Schellens, H. van Keer, M. Valcke, B. de Wever
Venue: Behaviour & Information Technology (2007)

The research reported in the current article studies the impact of learning in asynchronous discussion groups on students' final exam scores and levels of knowledge construction. Multilevel analyses were applied to uncover the specific influence of student, group and task variables. The results indicate that the impact of student characteristics on both dependent variables is of higher significance than characteristics of the discussion group students are allocated to. With regard to levels of knowledge construction, task characteristics also appear to be of importance.  With regard to final exam scores the analyses reveal a significant impact from student learning style, attitude towards task-based learning, the number of student contributions and the level of knowledge construction in these contributions. No significant group characteristics were observed.  As to levels of knowledge construction, the analyses revealed that the amount of contributions and the attitude towards the online learning environment are significant predictors. The intensity of the interaction in a group had a significant impact. As to task characteristics, significant differences were found between consecutive themes. These disappeared when taking into account task complexity.
Optimal run time for EMQ model with backordering, failure-in-rework and breakdown happening in stock-piling time
Authors: Yuan-Shyi Peter Chiu, Singa Wang Chiu, Hsien-Ju Chuang, Chia-Kuan Ting, Yu-Lung Lien
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

This study examines the optimal run time for the economic manufacturing quantity (EMQ) model with failure-in-work, backlogging, and random breakdown happening in stock-piling time. A recent paper by Chiu and Chiu [Mathematical modeling for production system with backlogging and failure in repair. Journal of Scientific & Industrial Research, 65 (2006) 499-506] investigated optimal lot-size for EMQ model with backordering and failure-in-rework. By incorporating random machine breakdown-another inevitable reliability factor into their model, this research examines its effects on the optimal run time and on the long-run average costs. Mathematical modeling and cost analysis are employed and the renewal reward theorem is used to cope with variable cycle length. Convexity of the expected production- inventory cost function is proved. An optimal replenishment policy that minimizes overall costs is derived for such an unreliable system. Numerical example is provided to show its practical usage. Managers in the field can adopt this run time decision to establish their own robust production plan accordingly.
A Hypertension Management System with Emergency Monitoring
Authors: Eungyeong Kim, Hyogun Yoon, Yupeng Zhang, Malrey Lee, Jaewan Lee
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This paper proposes a u-Healthcare system that can perceive emergency situations in chronic hypertension patients and initiate emergency action. The proposed system considers patient mobility and integrates a medical recommendations knowledge base and communication protocols between system agents in an RFID and Cell phone architecture. A comparison and analysis of the proposed system and the operational characteristics of an implemented system is provided. The proposed system can supply information to assist patients in normal health management as well as emergency situations.
Applying Distributed Classification Algorithms to Wireless Sensor Networks - A Brief View into the Application of the SPRINT Algorithm Family
Authors: Birger Lantow
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The SPRINT algorithm describes a distributed way to construct a decision tree for classification in large data sets. It can be applied to in-network classification tree construction. The costly data transfer of sensor data to the sink can be avoided while execution time is still acceptable. The SPRINT algorithm and its extensions are introduced. Furthermore, different scenarios that implement classification tree construction based on WSN data are evaluated. A WSN-Model is given. Special characteristics of WSN are implied. Tools for a task specific selection of WSN data processing organisation are sketched.
Comparison between Voxel-based Morphometry and Volumetric Analysis in Schizophrenia
Authors: Jing Zhang, Monte S. Buchsbaum, Kingwai Chu, Erin A. Hazlett
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This study compares the voxel-based morphometry (VBM) and region-of-interest (ROI)-based volumetric analysis in schizophrenia. Magnetic Resonance Imaging (MRI) data of 50 unmedicated schizophrenia patients and 82 healthy controls were examined. ROI-based volumetric analysis was performed by tracing caudates on anterior commissure and posterior commissure (ACPC)-positioned MRI. The comparison of 20 subjects in the lower and upper 25% for traced caudate size and the comparison between patients and controls revealed significantly reduced gray matter concentration in the caudate through VBM. Caudate volume (absolute and relative) revealed that patients with schizophrenia had smaller caudate nuclei than controls. The ROC results demonstrated that the performance of VBM (area under the curve (AUC): 61%) was similar to that of ROI-based volumetric analysis (AUC: 61% for relative ROI volume) and their correlation was 0.51 (p
IDEs in the Age of Eclipse
Venue: Queue (2006)

In this edition of the ACM Queuecast hosted by Mike Vizard, Oracle's chief architect for tools and middleware Ted Farrell talks about the role of IDEs in the Eclipse open source era, and why developers still need IDE tools to better leverage a wide variety of middleware assets and take a more modular approach to building complex business applications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The effects of video image frame rate on the environmental hazards recognition performance in using remote vision to navigate visually impaired pedestrians
Authors: Vanja Garaj, Ziad Hunaiti, Wamadeva Balachandran
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)

This paper presents the results of a study to determine the effects of video image frame rate on the performance of the sighted human guide in recognizing static hazards in the travel environment - a basic activity in using remote vision to navigate visually impaired pedestrians. The results show that variations in the frame rate (25 fps and 2 fps) do not cause a significant difference in the ability to recognize static hazards in the travel environment based on video image. The study was conducted as a part of the process of development of a novel system for navigation of visually impaired people. The system, titled the System for Remote Sighted Guidance of Visually Impaired Pedestrians, is being developed by the Electronic Systems Research Group at the School of Engineering and Design, Brunel University.
Multiple vertex coverings by specified induced subgraphs
Authors: Zoltán Füredi, Dhruv Mubayi, Douglas B. West
Venue: Journal of Graph Theory (2000)

Given graphs H1,&hellip;, Hk, let f(H1,&hellip;, Hk) be the minimum order of a graph G such that for each i, the induced copies of Hi in G cover V(G). We prove constructively that f(H1, H2)&thinsp;&le;&thinsp;2(n(H1)&thinsp;+&thinsp;n(H2)&thinsp;-&thinsp;2); equality holds when H1&thinsp;=&thinsp; $\overline{H}$2&thinsp;=&thinsp;Kn. We prove that f(H1, $\overline{K}$n)&thinsp;=&thinsp;n&thinsp;+&thinsp;2&radic;&delta;(H1)n&thinsp;+&thinsp;O(1) as n&thinsp;&rarr;&thinsp;&infin;. We also determine f(K1,&thinsp;m&thinsp;-1, $\overline{K}$n) exactly. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 180&ndash;190, 2000
Near-optimal dynamic replication in unstructured peer-to-peer networks
Authors: Mauro Sozio, Thomas Neumann, Gerhard Weikum
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Replicating data in distributed systems is often needed for availability and performance. In unstructured peer-to-peer networks, with epidemic messaging for query routing, replicating popular data items is also crucial to ensure high probability of finding the data within a bounded search distance from the requestor. This paper considers such networks and aims to maximize the probability of successful search. Prior work along these lines has analyzed the optimal degrees of replication for data items with non-uniform but global request rates, but did not address the issue of where replicas should be placed and was very very limited in the capabilities for handling heterogeneity and dynamics of network and workload. This paper presents the integrated P2R2 algorithm for dynamic replication that addresses all these issues, and determines both the degrees of replication and the placement of the replicas in a provably near-optimal way. We prove that the P2R2 algorithm can guarantee a successful-search probability that is within a factor of 2 of the optimal solution. The algorithm is efficient and can handle workload evolution. We prove that, whenever the access patterns are in steady state, our algorithm converges to the desired near-optimal placement. We further show by simulations that the convergence rate is fast and that our algorithm outperforms prior methods.
Access pattern-based code compression for memory-constrained systems
Authors: Ozcan Ozturk, Mahmut Kandemir, Guangyu Chen
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

As compared to a large spectrum of performance optimizations, relatively less effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of addressing this constraint is to compress executable code and data as much as possible. While researchers on code compression have studied efficient hardware and software based code compression strategies, many of these techniques do not take application behavior into account; that is, the same compression/decompression strategy is used irrespective of the application being optimized. This article presents an application-sensitive code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks of the application are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose and evaluate several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts. Some of our strategies make use of profile data, whereas others are fully automatic. Our experimental evaluation using seven applications from the MediaBench suite and three large embedded applications reveals that the proposed code compression strategy is very successful in practice. Our results also indicate that working at a basic block granularity, as opposed to a procedure granularity, is important for maximizing memory space savings.
The asymptotic complexity of merging networks
Authors: P. B. Miltersen
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Let M(m,n) be the minimum number of comparators needed in a comparator network that merges m elements x/sub 1/or=m. Batcher's odd-even merge yields the following upper bound: M(m,n)or=m to infinity :M(m,n)>or=/sup 1///sub 2/(m+n)log/sub 2/(m+1)-O(m); in particular, M(n,n)>or=nlog/sub 2/n-O(n). The authors' proof technique extends to give similarly tight lower bounds for the size of monotone Boolean circuits for merging, and for the size of switching networks capable of realizing the set of permutations that arise from merging.
Automatic thesaurus construction
Authors: Dongqiang Yang, David M. Powers
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

In this paper we introduce a novel method of automating thesauri using syntactically constrained distributional similarity. With respect to syntactically conditioned cooccurrences, most popular approaches to automatic thesaurus construction simply ignore the salience of grammatical relations and effectively merge them into one united 'context'. We distinguish semantic differences of each syntactic dependency and propose to generate thesauri through word overlapping across major types of grammatical relations. The encouraging results show that our proposal can build automatic thesauri with significantly higher precision than the traditional methods.
On the complexity of monotone dualization and generating minimal hypergraph transversals
Authors: Khaled M. Elbassioni
Venue: Discrete Applied Mathematics (2008)

In 1994 Fredman and Khachiyan established the remarkable result that the duality of a pair of monotone Boolean functions, in disjunctive normal forms, can be tested in quasi-polynomial time, thus putting the problem, most likely, somewhere between polynomiality and coNP-completeness. We strengthen this result by showing that the duality testing problem can in fact be solved in polylogarithmic time using a quasi-polynomial number of processors (in the PRAM model). While our decomposition technique can be thought of as a generalization of that of Fredman and Khachiyan, it yields stronger bounds on the sequential complexity of the problem in the case when the sizes of f and g are significantly different, and also allows for generating all minimal transversals of a given hypergraph using only polynomial space.
Context and linking in retrieval from personal digital archives
Authors: Liadh Kelly
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Advances in digital capture and storage technologies mean that it is now possible to capture and store one's entire life experiences in personal digital archives. These vast personal archives (or Human Digital Memories (HDMs)) pose new challenges and opportunities for the research community, not the least of which is developing effective means of retrieval from HDMs. Personal archive retrieval research is still in its infancy and there is much scope for novel research. My PhD proposes to develop effective HDM retrieval algorithms by combining rich sources of context associated with items, such as location and people present data, with information obtained by linking HDM items in novel ways.
Collegial verbalisation - a case study on a new method on information acquisition
Authors: M. Erlandsson, A. Jansson
Venue: Behaviour & Information Technology (2007)

The purpose of this paper is to propose and discuss a new method for information acquisition called collegial verbalisation. The method is explored in an empirical case study, and it consists of vehicle operators being videotaped while driving, followed by some of their colleagues making verbal reports while watching the video data. These colleagues have previously experienced exactly the same driving task as the operators, that is, they have travelled the same route, with the same craft, and used the same instrumentation. Thus, they are very familiar with the driving task and the driver environment. The empirical study is carried out on a high-speed ferry. The method is explored in relation to three rather open hypotheses: the amount of information provided in general; the reliability of the data; and how it contributes to the detection of 'buggy mental models' within the operators. The method is discussed in relation to the more traditional forms of verbal reports: concurrent and retrospective verbalisations, respectively. From the results of the empirical exploration, it is suggested that the method of collegial verbalisation may have combinatorial advantages that makes it more powerful as an analytical tool than the traditional forms of verbalisation, specifically if one wants to analyse work tasks that are dynamic and where the operators' behaviours are highly automated. However, more elaborate and systematic investigations must be conducted on the topic, and the paper therefore ends with a suggestion on an experimental design for this purpose.
Reconstruction of 3D solid models using fuzzy logic recognition
Authors: Zhe Wang, Mohammed Latif
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

This paper presents an application of fuzzy logic theory to the reconstruction of solid models from engineering drawings. In engineering drawing, two-dimensional (2D) orthographic projections represent an object ambiguously, it requires a numerous amount of combinatorial searches in the process of reconstruction of three-dimensional (3D) drawing. This paper proposes an algorithm which applies fuzzy logic to identify the category of the object in order to implement the further operations. Once an object has been classified to be either rotational or prismatic the major operation of either revolve or extrude will be executed correspondingly to generate the 3D solid model. Compared with earlier approaches, the present method focuses on ambiguous issues which improves the efficiency of the reconstruction process. A program has been compiled to implement the present algorithm which has proved to be very practicable.
Delay models of single-source single-relay cooperative ARQ protocols in slotted radio networks with Poisson frame arrivals
Authors: Isabella Cerutti, Andrea Fumagalli, Puja Gupta
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

In conventional (noncooperative) automatic repeat request (ARQ) protocols for radio networks, the corrupted data frames that cannot be correctly decoded at the destination are retransmitted by the source. In cooperative ARQ protocols, data frame retransmissions may be performed by a neighboring node (the relay) that has successfully overheard the source's frame transmission. One advantage of the latter group of ARQ protocols is the spatial diversity provided by the relay. The first delay model for cooperative ARQ protocols is derived in this paper. The model is analytically derived for a simple set of retransmission rules that make use of both uncoded and coded cooperative communications in slotted radio networks. The model estimates the delay experienced by Poisson arriving frames, whose retransmissions (when required) are performed also by a single relay. Saturation throughput, data frame latency, and buffer occupancy at both the source and relay are quantified and compared against two noncooperative ARQ protocols.
Student internships: developing real world skills for real world problem solutions
Authors: Ghassan Alkadi
Venue: Journal of Computing Sciences in Colleges (2008)

This paper discusses a software engineering project and its results as accomplished by a student through a summer internship program. It involves a streaming video surveillance system, which contains four main parts: IP based camera(s) streaming MJPEG, a main encoding server, a central distribution server and a set of clients.