ppxscal/embedding_network huggingface dataset:
Security and privacy system architecture for an e-hospital environment
Authors: Kathryn Garson, Carlisle Adams
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

Hospitals are now using electronic medical records and computer applications in order to provide more efficient and thorough care for their patients. The Mobile Emergency Triage system provides doctors with decision support for emergency care by pulling information from a patient's health record and a medical literature database. In order to achieve compliance with privacy legislations PIPEDA and PHIPA, security and privacy measures must be put in place. Encryption and access control are necessary for ensuring proper authorization and confidentiality for patient records. Strong authentication and audit logs are required to ensure access only by those allowed. We discuss differences in security technologies and detail the ones used in our MET system. A new encryption technology called policy-based encryption proves to be quite useful within a health care environment for providing both encryption and access control. We propose an extension to an existing scheme which allows for the use of this cryptography in a hospital setting.
Private queries in location based services: anonymizers are not necessary
Authors: Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, Cyrus Shahabi, Kian-Lee Tan
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must not be disclosed. Existing solutions utilize a trusted anonymizer between the users and the LBS. This approach has several drawbacks: (i) All users must trust the third party anonymizer, which is a single point of attack. (ii) A large number of cooperating, trustworthy users is needed. (iii) Privacy is guaranteed only for a single snapshot of user locations; users are not protected against correlation attacks (e.g., history of user movement). We propose a novel framework to support private location-dependent queries, based on the theoretical work on Private Information Retrieval (PIR). Our framework does not require a trusted third party, since privacy is achieved via cryptographic techniques. Compared to existing work, our approach achieves stronger privacy for snapshots of user locations; moreover, it is the first to provide provable privacy guarantees against correlation attacks. We use our framework to implement approximate and exact algorithms for nearest-neighbor search. We optimize query execution by employing data mining techniques, which identify redundant computations. Contrary to common belief, the experimental results suggest that PIR approaches incur reasonable overhead and are applicable in practice.
Multi-context photo browsing on mobile devices based on tilt dynamics
Authors: Sung-Jung Cho, Roderick Murray-Smith, Yeun-Bae Kim
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

This paper presents a photo browsing system on mobile devices to browse and search photos efficiently by tilting action. It employs tilt dynamics and a multi-scale photo screen layout for enhancing the browsing and the search capability respectively. The implementation uses continuous inputs from an accelerometer, and a multimodal (visual, audio and vibrotactile) display coupled with the states of this model. The model is based on a simple physical model, with its characteristics shaped to enhance controllability. The multi-scale layout holds both local and global view for users to both control photos and look at the surrounding context in a single framework. The experiment on Samsung MITs PDA used seven novice users browsing from 100 photos. We compare a tilt-based interaction method with a button-based browser and an iPod wheel by a quantitative usability criteria and subjective experience. The proposed tilt dynamics improves the usability over conventional dynamics. The iPod wheel has mixed performance comparing worse on some metrics than button pushing or tilt interaction, despite its commercial popularity.
Characterizations of the basic feasible functionals of finite type
Authors: S. A. Cook, B. M. Kapron
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors define a simple typed while-programming language that generalizes the sort of simple language used in computability texts to define the familiar numerical computable functions and corresponds roughly to the mu -recursion of R.O. Gandy (1967). This language does not fully capture the notion of higher type computability. The authors define run times for their programs and prove that the feasible functionals of S. Cook and A. Urquhart (1988) are precisely those functionals computable by typed while-programs with run times feasibly length-bounded. The authors introduce the notion of a bounded typed loop program and prove that a finite type functional is feasible if it is computable by a bounded typed loop program.
Research on Evaluation of E-Commerce WebSites Based on Linguistic Ordered Weighted Averaging Operator
Authors: Peide Liu, Ruishan Hu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Along with the development of network economy, the E-commerce becomes a very popular and innovative business model which has bright prospect. How to evaluate those E-commerce websites equitably and objectively becomes a problem that both customers and website investors pay close attention to. This paper introduced an E-commerce websites evaluation system and then proposed a method to evaluate E-commerce websites based on LWD (Linguistic Weighted Disjunction) and LOWA(Linguistic Ordered Weighted Averaging) operator. This method is practical and feasible.
A regression-based approach to scalability prediction
Authors: Bradley J. Barnes, Barry Rountree, David K. Lowenthal, Jaxk Reeves, Bronis de Supinski, Martin Schulz
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

Many applied scientific domains are increasingly relying on large-scale parallel computation. Consequently, many large clusters now have thousands of processors. However, the ideal number of processors to use for these scientific applications varies with both the input variables and the machine under consideration, and predicting this processor count is rarely straightforward. Accurate prediction mechanisms would provide many benefits, including improving cluster efficiency and identifying system configuration or hardware issues that impede performance. We explore novel regression-based approaches to predict parallel program scalability. We use several program executions on a small subset of the processors to predict execution time on larger numbers of processors. We compare three different regression-based techniques: one based on execution time only; another that uses per-processor information only; and a third one based on the global critical path. These techniques provide accurate scaling predictions, with median prediction errors between 6.2% and 17.3% for seven applications.
The hybrid analysis method based on current and nodal voltage in power network
Authors: Wang Chengmin, Jiang Chuanwen
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A novel hybrid analysis method for power flow calculation based on nodal voltage and loop current equations of electric power network is presentd. In this method the load is considered as voltage source. The impedance branch and ground branch were treated as the link and tree branch respectively in the π loop model. Moreover, the problems about the node and loop degradation are particularly expatiated as well as nodal type and load model treatment during the process of power flow calculation. It is showed that amount of foundational loops eaual to the quantity of total lines minus the number of degradation loops. Then, the relations combined the loop analysis with the voltage stability are revealed by analyzing the existence and multi-value of the power flow solutions. The case study is made at the IEEE-30 system and the result shows that the persented hybrid analysis method is effective for the power flow calculation.
Mixing Frequency Bio-impedance Measurement Technology based on DFT and Virtual Reference Vector
Authors: Wang Chao, Huang Chunyan, Zhang Xiaoli, Wang Huaxiang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In order to obtain bio-impedance information at different frequency simultaneously, the bio-impedance measurement method in the condition of mixing frequency excitation is studied in this paper. The influence of energy leakage and fence effect of DFT to sine signal detection is analyzed, according to which the bio-impedance measurement technology based on DFT with virtual reference vector is presented. Finally, compensation of virtual reference vector is certificated by emulations and experiments. From the experimental results, the dynamic reaction of respiratory and cardiac activity in different frequency can be manifested according to the human impedance measurement.
Process Variation Aware Bus-Coding Scheme for Delay Minimization in VLSI Interconnects
Authors: Chittarsu Raghunandan, K. S. Sainarayanan, M. B. Srinivas
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Process variations can have a significant impact on both device and interconnect performance in Deep Sub-Micron (DSM) technology. In this paper, initially authors discuss the effects of process parameter variations on bus-encoding schemes for delay minimization in VLSI interconnects. Later, process variation aware bus-coding scheme is proposed to reduce delay in interconnects. It is shown that if process variability is taken into consideration, effective capacitance (Ceff) of the bus lines varies because of which the amount of delay that each crosstalk class causes is going to vary. SPICE simulations have been carried out for interconnect lines of different dimensions at different technology nodes (180, 130, 90 and 65 nm) to find out the effect of process variation on the effective capacitance of bus lines and to evaluate the percentage delay reduction due to proposed coding scheme.
Domain-based context management for dynamic and evolutionary environments
Authors: Ricardo Couto A. da Rocha, Markus Endler
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

Research in context-aware computing has produced a number of application prototypes, frameworks, middlewares and models for describing context. However, development of ubiquitous context-aware applications is still a difficult task because current middleware systems are focused on isolated and static context-aware environments. Currently, applications require a global knowledge of the context-aware infrastructures in order to establish context-based interactions, and they suffer of problems such as disruptions when a context-aware environment evolves. The goal of this thesis is to develop a distributed middleware for context-aware computing that allows applications to maintain context-based continuous interactions, even in a highly dynamic environment. In order to achieve this goal, we propose a context management strategy based on context domains. We argue that this approach supports four important requirements for context-aware ubiquitous applications: distributed management of context, support for seamless evolution of context-aware systems, dynamic context discovery and domains of context perception.
Business-Based SMS Mobile Search
Authors: Benting Wan
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Comparing to WAP-based mobile search, SMS-based (Short Message Service based) mobile search needs to obtain exact search results. In order to improve SMS-based mobile search usability, the Business-based SMS mobile search is proposed. All businesses are classified into local search business and web exact search business and web fuzzy search business to SMS mobile search, the local and web exact search business can promise the exact result for mobile users, and web search business can provide enough information of Internet for mobile users. In order to get more exact business type from short message provided by mobile users, the multi-keyword business and keyword fuzzy match strategies are used to SMS mobile search. The implementation shows that Business-based SMS mobile search has good efficiency.
EMPIRICAL RESEARCH OF THE PRINCIPAL COMPONENT ANALYSIS AND ORDERED WEIGHTED AVERAGING INTEGRATED EVALUATION MODEL ON SOFTWARE PROJECTS
Authors: Duen-Yian Yeh, Ching-Hsue Cheng, Hwei-Wun Yio
Venue: Cybernetics and Systems (2007)

With the restrictions of time and cost, the complexity of software project development implies that the software industry cannot develop high quality products to satisfy the customers' needs. The evaluation of software development cannot only assist the deciders with the prediction of feasibility and the impact of benefits in advance, but also offer excellent help for the improvement and developing strategy of management after software project is developed. This research proposed a principal component analysis (PCA) and ordered weighted averaging (OWA) integrated evaluation model to overcome the complexity adhered in appropriately evaluating the development of software projects. The distinguishing characteristic of this model lies in integrating the respective advantages of PCA and OWA operators to appropriately evaluate the development of software projects. In this model, a well-designed questionnaire was used to express the experts' opinions on the development of software projects with respect to each criterion. The amount of evaluation results was reduced by means of PCA with the aim at cutting down the number of criteria but the accumulated variance of the original ones was preserved. OWA was used to flexibly obtain the weights of resultant criteria under the consideration of information requirement. In empirical validation, three software projects belonging to one famous hospital in Taiwan were selected as the targets to examine the appropriateness of this model. A comparison was taken to reveal the superiority of this model. As expected, the model was more effective with the increased complexity the evaluation of software project development.
Link stress reduction in topology-aware overlay path monitoring
Authors: M. Fraiwan, G. Manimaran
Venue: Computer Communications (2008)

Overlay networks often employ end-to-end probes to track network performance. These probes are routed through overlay paths, which usually overlap at the overlay level. In addition, two seemingly disjoint overlay paths may share many physical links at the IP level, causing high link stress. Several monitoring algorithms have been proposed to reduce the overall probing overhead. Surprisingly, they do not address the associated problem of high link stress. The high link stress presents an additional load on the network links, which could cause congestion, delay, and measurement conflict. In this paper, we aim at reducing the link stress associated with probing algorithms by introducing the concept of Internal Probing, where readily available IP-level topology information is used in conjunction with the overlay topology to reduce the link stress on highly shared path segments. Simulation results show that the proposed scheme can reduce the link stress by up to 30%.
Fishspear: A Priority Queue Algorithm
Authors: M. J. Fischer
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

The Fishspear priority queue algorithm is presented and analyzed. Fishspear makes fewer than 80% as many comparisons as heaps in the worst case, and its relative performance is even better in rnany common situations. The code itself embodies an unusual recursive structure which permits highly dynamic and data-dependent execution. Fishspear also differs from heaps in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it possibly attractive for implementation of very large queues on paged memory systems. (Details of the implementation are deferred to the full paper.)
Certificate translation for specification-preserving advices
Authors: Gilles Barthe, César Kunz
Venue: Proceedings of the 7th workshop on Foundations of aspect-oriented languages (2008)

Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, in which the expected functionality is provided by a baseline program, that is successively refined, possibly by third parties, with aspects that improve non-functional concerns, such as efficiency and security. Therefore, AOP is a natural enabler for Proof Carrying Code (PCC) scenarios. The purpose of this article is to explore a PCC architecture that accommodates an incremental development process. We extend our earlier work on certificate translation, and show in the context of a very simple AOP language that it is possible to generate certificates of executable code from proofs of aspect-oriented programs. To achieve this goal, we introduce a notion of specification-preserving advice, and provide a verification method for programs with specification-preserving advices.
Gender in end-user software engineering
Authors: Margaret Burnett, Susan Wiedenbeck, Valentina Grigoreanu, Neeraja Subrahmaniyan, Laura Beckwith, Cory Kissinger
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

In this paper, we describe research that reports gender differences in usage of software engineering tools by end-user programmers. We connect these findings with possible explanations based on theories from other disciplines, and then add to that our recent results that these differences go deeper than software engineering tool usage to software engineering strategies. We enumerate the strategies that work better for males and the ones that work better for females, and discuss implications and possible directions for follow-up.
Embedding Planar Graphs In Seven Pages
Authors: L. Heath
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

This paper investigates the problem of embedding planar graphs in books of few pages. An efficient algorithm for embedding a planar graph in a book establishes an upper bound of seven pages for any planar graph. This disproves a conjecture of Bernhart and Kainen that the pagenumber of a planar graph can be arbitrarily large. It is also shown that the stellations of K/sub 3/ have pagenumber three, the best possible. 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
Optimum Routing and Forwarding Arrangement in Bufferless Data Vortex Switch Network
Authors: Qimin Yang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Data Vortex networks with different routing and forwarding path arrangements are studied. To keep the bufferless routing nodes, the binary tree decoding stages in Data Vortex network are shown to achieve best combined routing performance in throughput and latency. When k is too large, the general k-ary decoding stages introduce too much deflection latency penalty, so this paper focuses on the performance comparison between the binary tree (k=2) decoding and 4-ary decoding (k=4) cases. The results have shown that even though a much smaller number of cylinder levels are required in a network of k=4, there is only slight reduction in the average packet latency within the network. On the other hand, the traffic backpressure induced throughput limit and the additional implementation cost in 4-ary decoding networks have proved that binary tree decoding stages offer the optimum performance under bufferless operations. The study has in part shown the advantages of Data Vortex network topology over many two dimensional multiple stage interconnection networks (MIN) if only deflection is allowed for bufferless operation.
Tera-scale computing and interconnect challenges
Authors: Jerry Bautista
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Future CPU directions are increasingly emphasizing parallel compute platforms which are critically dependent upon upon greater core to core communication as well as generally stressing the overall memory and storage interconnect hierarchy to a much greater degree than extrapolations of past platform needs. Performance is critically dependent upon memory bandwidth and latency but must be moderated with power and cost considerations. 3D stacking of CPU's and memory (i.e. a last level cache) is a potential solution that provides the necessary bandwidth within a reasonable power envelope.
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Authors: Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
Venue: Computers and Operations Research (2008)

In this paper, an improved two-stage simulated annealing algorithm is presented for the minimum linear arrangement problem for graphs. This algorithm integrates several distinguished features including an efficient heuristic to generate good quality initial solutions, a highly discriminating evaluation function, a special neighborhood function and an effective cooling schedule. The algorithm is evaluated on a set of 30 well-known benchmark instances of the literature and compared with several state-of-the-art algorithms, showing improvements of 17 previous best results.
Stratification of forest density and its validation by NDVI analysis in a part of western Himalaya, India using Remote sensing and GIS techniques
Authors: A. Kumar, S. K. Uniyal, B. Lal
Venue: International Journal of Remote Sensing (2007)

This study deals with the assessment of the status of forest density in the Kangra district of Himachal Pradesh, western Himalaya. A classified forest map of the area with an accuracy of 88.17% was produced using the hybrid classification method in Erdas Imagine. An IRS 1D LISS III satellite image was used for mapping and classification. Forest density was calculated in the ArcGIS environment by overlaying a mesh of uniform resolution cells (500 m×500 m) on a classified forest map. The forest density value of each cell was later used for the preparation of forest density contours. The forest density output was verified by Normalized Difference Vegetation Index (NDVI) analyses. The forest cover of the study area was found to be 34.3%. Baroh area had the highest (45.87%) forest density and Baijnath (18.65%) the lowest. Central and western regions of the district showed high-value forest density contours (>50%). The derived NDVI values were compared against the forest density classes for assessing the accuracy of the results obtained. A positive correlation (r = 0.99) between NDVI values and forest density confirms the accuracy of the results.