snu-aidas/HVMap-dataset huggingface dataset:
Elliptic Curve Multiset Hash

A homomorphic, or incremental, multiset hash function, associates a hash value to arbitrary collections of objects (with possible repetitions) in such a way that the hash of the union of two collections is easy to compute from the hashes of the two collections themselves: it is simply their sum under a suitable group operation. In particular, hash values of large collections can be computed incrementally and/or in parallel. Homomorphic hashing is thus a very useful primitive with applications ranging from database integrity verification to streaming set/multiset comparison and network coding. Unfortunately, constructions of homomorphic hash functions in the literature are hampered by two main drawbacks: they tend to be much longer than usual hash functions at the same security level (e.g. to achieve a collision resistance of 2, they are several thousand bits long, as opposed to 256 bits for usual hash functions), and they are also quite slow. In this paper, we introduce the Elliptic Curve Multiset Hash (ECMH), which combines a usual bit string-valued hash function like BLAKE2 with an efficient encoding into binary elliptic curves to overcome both difficulties. On the one hand, the size of ECMH digests is essentially optimal: 2m-bit hash values provideO(2) collision resistance. On the other hand, we demonstrate a highly-efficient software implementation of ECMH, which our thorough empirical evaluation shows to be capable of processing over 3 million set elements per second on a 4 GHz Intel Haswell machine at the 128-bit security level— many times faster than previous practical methods. While incremental hashing based on elliptic curves has been considered previously [1], the proposed method was less efficient, susceptible to timing attacks, and potentially patent-encumbered [2], and no practical implementation was demonstrated.
Automated detection of vulnerabilities in privileged programs by execution monitoring

We present a method for detecting exploitations of vulnerabilities in privileged programs by monitoring their execution using audit trials, where the monitoring is with respect to specifications of the security-relevant behavior of the programs. Our work is motivated by the intrusion detection paradigm, but is a n attempt to avoid a d hoc approaches to codifying misuse behavior. Our approach as based on the observation that although privileged programs can be exploited (due to errors) to cause security compromise in systems because of the privileges accorded to them, the intended behavior of privileged programs is, of course, limited a n d benign. The key, then i s to specify the intended behavior (Le., the program policy) and to detect any action by privileged program that is outside the intended behavior a n d that imperils security. We describe a program policy specification language, which is based on simple predicate logic and regular expressions. I n addition, we present specifications of privileged programs in Unix, and Q prototype execution monitor for analyzing audit trails with respect to these specifications. The program policies are surprisingly concise and clear, a n d an addition, capable of detecting exploitations of known vulnerabilities in these programs. Although our work has been motivated by the known vulnerabilities in Unix, we believe that by tightly restricting the behavior of all privileged programs, exploitations of unknown vulnerabilities can be detected. A s Q check on the specifications, work is in progress on verifying them with respect to a n abstract security policy. *This work is funded in part by the National Security Agency University Research Program under Contract No. DOD-MDA904-93-C4083 and by ARPA under Contract No. USNN00014-94-1-0065.
A review and outlook for a 'Building Information Model' (BIM): A multi-standpoint framework for technological development

1474-0346/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.aei.2010.06.003 * Tel.: +386 1 4768 521; fax: +386 1 4250 681. E-mail address: tomo.cerovsek@fgg.uni-lj.si This study provides a review of important issues for ‘Building Information Modelling’ (BIM) tools and standards and comprehensive recommendations for their advancement and development that may improve BIM technologies and provide a basis for inter-operability, integration, model-based communication, and collaboration in building projects. Based on a critical review of Building Product Modelling, including the development of standards for exchange and the features of over 150 AEC/O (Architecture, Engineering, Construction, and Operation) tools and digital models, a methodological framework is proposed for improvements to both BIM tools and schemata. The features relevant to the framework were studied using a conceptual process model and a ‘BIM System-of-Systems’ (BIM-SoS) model. The development, implementation, and use of the BIM Schema are analysed from the standpoint of standardisation. The results embrace the requirements for a BIM research methodology, with an example of methods and procedures, an R&D review with critique, and a multi-standpoint framework for developments with concrete recommendations, supported by BIM metrics, upon which the progress of tools, models, and standards may be measured, evaluated, streamlined, and judged. It is also proposed that any BIM Schema will never be ‘completed’ but should be developed as evolutionary ontology by ‘segmented standpoint models’ to better account for evolving tools and AEC/O practices. 2010 Elsevier Ltd. All rights reserved.
A comparative study of metamodeling methods for multiobjective crashworthiness optimization

The response surface methodology (RSM), which typically uses quadratic polynomials, is predominantly used for metamodeling in crashworthiness optimization because of the high computational cost of vehicle crash simulations. Research shows, however, that RSM may not be suitable for modeling highly nonlinear responses that can often be found in impact related problems, especially when using limited quantity of response samples. The radial basis functions (RBF) have been shown to be promising for highly nonlinear problems, but no application to crashworthiness problems has been found in the literature. In this study, metamodels by RSM and RBF are used for multiobjective optimization of a vehicle body in frontal collision, with validations by finite element simulations using the full-scale vehicle model. The results show that RSM is able to produce good approximation models for energy absorption, and the model appropriateness can be well predicted by ANOVA. However, in the case of peak acceleration, RBF is found to generate better models than RSM based on the same number of response samples, with the multiquadric function identified to be the most stable RBF. Although RBF models are computationally more expensive, the optimization results of RBF models are found to be more accurate. 2005 Elsevier Ltd. All rights reserved.
Accuracy of Ultrasound-Guided Genicular Nerve Block: A Cadaveric Study.

BACKGROUND
Genicular nerve block has recently emerged as a novel alternative treatment in chronic knee pain. The needle placement for genicular nerve injection is made under fluoroscopic guidance with reference to bony landmarks.


OBJECTIVE
To investigate the anatomic landmarks for medial genicular nerve branches and to determine the accuracy of ultrasound-guided genicular nerve block in a cadaveric model.


STUDY DESIGN
Cadaveric accuracy study.


SETTING
University hospital anatomy laboratory.


METHODS
Ten cadaveric knee specimens without surgery or major procedures were used in the study. The anatomic location of the superior medial genicular nerve (SMGN) and the inferior medial genicular nerve (IMGN) was examined using 4 knee dissections. The determined anatomical sites of the genicular nerves in the remaining 6 knee specimens were injected with 0.5 mL red ink under ultrasound guidance. The knee specimens were subsequently dissected to assess for accuracy. If the nerve was dyed with red ink, it was considered accurate placement. All other locations were considered inaccurate.


RESULTS
The course of the SMGN is that it curves around the femur shaft and passes between the adductor magnus tendon and the femoral medial epicondyle, then descends approximately one cm anterior to the adductor tubercle. The IMGN is situated horizontally around the tibial medial epicondyle and passes beneath the medial collateral ligament at the midpoint between the tibial medial epicondyle and the tibial insertion of the medial collateral ligament. The adductor tubercle for the SMGN and the medial collateral ligament for the IMGN were determined as anatomic landmarks for ultrasound. The bony cortex one cm anterior to the peak of the adductor tubercle and the bony cortex at the midpoint between the peak of the tibial medial epicondyle and the initial fibers inserting on the tibia of the medial collateral ligament were the target points for the injections of SMGN and IMGN, respectively. In the cadaver dissections both genicular nerves were seen to be dyed with red ink in all the injections of the 6 knees.


LIMITATIONS
The small number of cadavers might have led to some anatomic variations of genicular nerves being overlooked.


CONCLUSIONS
The result of this cadaveric study suggests that ultrasound-guided medial genicular nerve branch block can be performed accurately using the above-stated anatomic landmarks.
#Proana: Pro-Eating Disorder Socialization on Twitter.

PURPOSE
Pro-eating disorder (ED) online movements support engagement with ED lifestyles and are associated with negative health consequences for adolescents with EDs. Twitter is a popular social media site among adolescents that provides a unique setting for Pro-ED content to be publicly exchanged. The purpose of this study was to investigate Pro-ED Twitter profiles' references to EDs and how their social connections (followers) reference EDs.


METHODS
A purposeful sample of 45 Pro-ED profiles was selected from Twitter. Profile information, all tweets, and a random sample of 100 of their followers' profile information were collected for content analysis using the Twitter Application Programming Interface. A codebook based on ED screening guidelines was applied to evaluate ED references. For each Pro-ED profile, proportion of tweets with ED references and proportion of followers with ED references in their own profile were evaluated.


RESULTS
In total, our 45 Pro-ED profiles generated 4,245 tweets for analysis. A median of 36.4% of profiles' tweets contained ED references. Pro-ED profiles had a median of 173 followers, and a median of 44.5% of followers had ED references. Pro-ED profiles with more tweets with ED references also tended to have more followers with ED references (β = .37, p < .01).


CONCLUSIONS
Findings suggest that profiles which self-identify as Pro-ED express disordered eating patterns through tweets and have an audience of followers, many of whom also reference ED in their own profiles. ED socialization on Twitter might provide social support, but in the Pro-ED context this activity might also reinforce an ED identity.
Phased array systems and technologies in SELEX-Sistemi Integrati: State of art and new challenges

This paper is a follow-on of [1] and [2], presented at 1996 and 2003 IEEE Intl. Symposium on Phased Array Systems and Technology, respectively. After a brief recall of 3D Long Range phased array concepts, already presented in [2], the focus is on the G-band multifunction radar systems and on the technological capabilities that SELEX-Sistemi Integrati is developing by taking advantage of its Research and Development facilities. At the end, future trends about new challenging applications and technological issues are presented and discussed.
The GRASP Multiple Micro-UAV Testbed

In the last five years, advances in materials, electronics, sensors, and batteries have fueled a growth in the development of microunmanned aerial vehicles (MAVs) that are between 0.1 and 0.5 m in length and 0.1-0.5 kg in mass [1]. A few groups have built and analyzed MAVs in the 10-cm range [2], [3]. One of the smallest MAV is the Picoftyer with a 60-mmpropellor diameter and a mass of 3.3 g [4]. Platforms in the 50-cm range are more prevalent with several groups having built and flown systems of this size [5]-[7]. In fact, there are severalcommercially available radiocontrolled (PvC) helicopters and research-grade helicopters in this size range [8].
Hybrid sampling Bayesian Occupancy Filter

Modeling and monitoring dynamic environments is a complex task but is crucial in the field of intelligent vehicle. A traditional way of addressing these issues is the modeling of moving objects, through Detection And Tracking of Moving Objects (DATMO) methods. An alternative to a classic object model framework is the occupancy grid filtering domain. Instead of segmenting the scene into objects and track them, the environment is represented as a regular grid of occupancy, in which each cell is tracked at a sub-object level. The Bayesian Occupancy Filter [1] is a generic occupancy grid framework which predicts the spread of spatial occupancy by estimating cell velocity distributions. However its velocity model, corresponding to a transition histogram per cell, leads to huge data management which in practice makes it hardly compatible to severe computational and hardware constraints, like in many embedded systems. In this paper, we present a new representation for the BOF, describing the environment through a mix of static and dynamic occupancy. This differentiation enables the use of a model adapted to the considered nature: static occupancy is described in a classic occupancy grid, while dynamic occupancy is modeled by a set of moving particles. Both static and dynamic parts are jointly generated and evaluated, their distribution over the cells being adjusted. This approach leads to a more compact model and to drastically improve the accuracy of the results, in particular in term of velocities. Experimental results show that the number of values required to model the velocities have been reduced from a typical 900 per cell (for a 30×30 neighborhood) to less than 2 per cell in average. The massive data compression allows to plan dedicated embedded devices.
Sensation seeking and internet dependence of Taiwanese high school adolescents

The present study examined excessive Internet use of Taiwanese adolescents and a psychological aspect of users, sensation seeking, thus to differentiate motivation of Internet dependents and non-dependents. Seven hundred and fifty three Taiwanese high school students were selected using cluster sampling and 88 of them were categorized as Internet dependent users. Results indicated that Internet dependents spent more time on-line than non-dependents. While Internet dependents perceived significantly more negative Internet influences on daily routines, school performance, and parental relation than non-dependents, both Internet dependents and non-dependents viewed Internet use as enhancing peer relations. Making friends through the Internet has become a popular activity among adolescents, potentially leading to its excessive use. Internet dependents scored significantly higher on overall sensation seeking and disinhibition than Internet non-dependents. However, both groups did not differ in the life experience seeking subscale and thrill and adventure seeking subscale. This finding contradicts that of Lavin, Marvin, McLarney, Nola, and Scott [CyberPsychol. Behav. 2 (2000) 425]. Possible reasons for this discrepancy and for the relation between Internet dependence and disinhibition in Taiwanese adolescents are also discussed. # 2002 Elsevier Science Ltd. All rights reserved.
Implementing GrabCut

GrabCut is an innovative 2D image segmentation technique developed by Rother et al. [2004]. This paper provides implementation details omitted from the original paper. Details covered in background papers are summarized here so that future implementors can refer to a single paper. Our implementation of GrabCut is described and results are included. Our main contribution is correcting errors in equation (9) and in equation (11) of the original paper. We also discuss weaknesses of the algorithm that were not discussed in the original paper. We present possible research directions to address these problems. CR Categories: I.4.6 [Image Processing and Computer Vision]: Segmentation—Pixel classification
Joint torques during sit-to-stand in healthy subjects and people with Parkinson's disease.

OBJECTIVES
To compare lower limb joint torques during sit-to-stand in normal elderly subjects and people with Parkinson's disease, using a developed biomechanical model simulating all phases of sit-to-stand.Design. A cross-sectional study utilizing a Parkinsonian and a control group.


BACKGROUND
Subjects with Parkinson's disease were observed to experience difficulty in performing sit-to-stand. The developed model was used to calculate the lower limb joint torques in normal elderly subjects and subjects with Parkinson's disease, to delineate possible causes underlying difficulties in initiating sit-to-stand task.


METHODS
Six normal elderly subjects and seven age-matched subjects with Parkinson's disease performed five sit-to-stand trials at their self-selected speed. Anthropometric data, two-dimensional kinematic and foot-ground and thigh-chair reactive forces were used to calculate, via inverse dynamics, the joint torques during sit-to-stand in both before and after seat-off phases. The difference between the control and Parkinson's disease group was analysed using independent t-tests.


RESULTS
Both control and Parkinson's disease groups had a similar joint kinematic pattern, although the Parkinson's disease group demonstrated a slower angular displacement. The latter subjects produced significantly smaller normalized hip flexion torque and presented a slower torque build-up rate than the able-bodied subjects (P<0.05).


CONCLUSION
Slowness of sit-to-stand in people with Parkinson's disease could be due to a reduced hip flexion joint torque and a prolonged rate of torque production.
Using BPM governance to align systems and practice

Purpose – The purpose of this paper is to propose a business process management (BPM) governance model that sets BPM decision making, along with roles and responsibilities. The setting context of the study is a government-owned corporation operating in Australia. Design/methodology/approach – A qualitative case study examined and analysed organisational documents using a content analysis approach. Results of document analysis are used to inform a series of in-depth interviews of key stakeholders in the organisation. Interviews are analysed using a constant comparison method to derive themes and build categories of description. Findings – A BPM governance model is proposed. Results of thematic analysis are interpreted against the framework of the BPM governance model, leading to findings that include implications for theory and practice. Practical implications – In practical terms, the research shows how BPM practice can be aligned and integrated with the corporate governance and management systems in the selected case study organisation. Originality/value – Despite research identifying the importance of governance, along with associated capabilities, there has been little progress on how the abovementioned capabilities can be effectively deployed across an organisation. This paper addresses a gap in the literature relating to how to deploy BPM governance in an organisation.
Estimation of probabilities from sparse data for the language model component of a speech recognizer

The description of a novel type of rn-gram language model is given. The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data. This solution compares favorably to other proposed methods. While the method has been developed for and successfully implemented in the IBM Real Time Speech Recognizers, its generality makes it applicable in other areas where the problem of estimating probabilities from sparse data arises. Sparseness of data is an inherent property of any real text, and it is a problem that one always encounters while collecting frequency statistics on words and word sequences (m-grams) from a text of finite size. This means that even for a very large data collection, the maximum likelihood estimation method does not allow us to adequately estimate probabilities of rare but nevertheless possible word sequences-many sequences occur only once (“singletons”); many more do not occur at all. Inadequacy of the maximum likelihood estimator and the necessity to estimate the probabilities of m-grams which did not occur in the text constitute the essence of the problem. The main idea of the proposed solution to the problem is to reduce unreliable probability estimates given by the observed frequencies and redistribute the “freed” probability “mass” among m-grams which never occurred in the text. The reduction is achieved by replacing maximum likelihood estimates for m-grams having low counts with renormalized Turing’s estimates [l], and the redistribution is done via the recursive utilization of lower level conditional distributions. We found Turing’s method attractive because of its simplicity and its characterization as the optimal empirical Bayes’ estimator of a multinomial probability. Robbins in [2] introduces the empirical Bayes’ methodology and Nadas in [3] gives various derivations of the Turing’s formula. Let N be a sample text size and let n, be the number of words (m-grams) which occurred in the text exactly r times, so that N = C rn,. (1) Turing’s estimate PT for a probability of a word (m-gram) which occurred in the sample r times is r
Efficient Scheduling of Arbitrary TAsk Graphs to Multiprocessors Using a Parallel Genetic Algorithm

Given a parallel program represented by a task graph, the objective of a scheduling algorithm is to minimize the overall execution time of the program by properly assigning the nodes of the graph to the processors. This multiprocessor scheduling problem is NP-complete even with simplifying assumptions and becomes more complex under relaxed assumptions such as arbitrary precedence constraints, and arbitrary task execution and communication times. The present literature on this topic is a large repertoire of heuristics that produce good solutions in a reasonable amount of time. These heuristics, however, have restricted applicability in a practical environment because they have a number of fundamental problems including high time complexity, lack of scalability, and no performance guarantee with respect to optimal solutions. Recently, genetic algorithms (GAs) have been widely reckoned as a useful vehicle for obtaining high quality or even optimal solutions for a broad range of combinatorial optimization problems. While a few GAs for scheduling have already been suggested, in this paper we propose a novel GA-based algorithm with an objective to simultaneously meet the goals of high performance, scalability, and fast running time. The proposed parallel genetic scheduling (PGS) algorithm itself is a parallel algorithm which generates high quality solutions in a short time. By encoding the scheduling list as a chromosome, the PGS algorithm can potentially generate an optimal scheduling list which in turn leads to an optimal schedule. The major strength of the PGS algorithm lies in its two efficient genetic operators: the order crossover and mutation. These operators effectively combine the building-blocks of good scheduling lists to construct better lists. The proposed algorithm is evaluated through a robust comparison with two heuristics best known in terms of performance and time complexity. It outperforms both heuristics while taking considerably less running time. When evaluated with random task graphs for which optimal solutions are known, the PGS algorithm generates optimal solutions for more than half of the test cases and close-to-optimal for the other half. © 1997 Academic Press