Identifiable semen donors-attitudes of donors and recipient couples

Abstract This paper explores the difference between two types of information: personal identifiable information (PII), and non-identifiable information (NII) to argue that security, policy, and technical requirements set PII apart from NII. The paper describes databases of personal identifiable information that are built exclusively for this type of information with their own conceptual scheme, system management, and physical structure.

Abstract This paper explores the difference between two types of information: personal identifiable information (PII), and non-identifiable information (NII) to argue that security, policy, and technical requirements set PII apart from NII. The paper describes databases of personal identifiable information that are built exclusively for this type of information with their own conceptual scheme, system management, and physical structure.

Stress fractures. Identifiable risk factors. Giladi M, Milgrom C, Simkin A, Danon Y. Tel Aviv Medical Center, Ichilov Hospital, Israel. To answer the question why such large differences in stress fracture morbidity rates (2% to 64%) exist in different countries, we prospectively evaluated 312 recruits for possible risk factors for stress fractures. Prior to training, each recruit underwent an evaluation including the following: orthopaedic examination, foot and tibial radiographs, measurements of tibial bone width, bone mineral content, bone...

Abstract. Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y ? C if di ? {xi, yi} for 1 = i = n. A code C is an identifiable parent property (IPP) code if the following property holds. Whenever we are given C and a descendant d of a pair of codewords in C, it is possible to determine at least one of these codewords. The paper introduces the notion of a prolific IPP code. An IPP code is prolific if all q n words are descendants. It is shown that linear prolific IPP codes fall into three i...

Abstract In order to provide copyright protection for digital contents, a distributor can place marks in each copy of a digital object. Placing different marks in different copies, makes each copy unique, and at the same time allows one to trace the source of an unauthorized distribution. This embedding mark technique, known as fingerprinting, was introduced by Wagner (1983). A problem arises when a group of dishonest users collude, compare their copies, and by changing the marks where their copies differ they create a new copy that conceals t...

The interest of using low magnitude speed adjustments as a means of resolving conflicts have recently risen. When implemented early, such changes could be not perceived by Air Traffic Controllers (ATCOs). Thus a significant cognitive resources release can be expected, entailing some benefits for the ATM system (esp. a global capacity improvement). The following work investigates controllers ? perception of aircraft speed modifications (ASM). These appeared to be neither easily identified nor clearly differentiable from spontaneous variations (c...

Abstract Presents a numerical method for the determination of the identifiable parameters of parallel robots. The special case of Stewart-Gough 6 degrees-of-freedom parallel robots is studied for classical and self calibration methods, but this method can be generalized to any kind of parallel robot. The method is based on QR decomposition of the observation matrix of the calibration system. Numerical relations between the parameters which are identified and those which are not identifiable can be obtained for each method.

Abstract In a fingerprinting scheme, marks are embedded in a digital object to protect intellectual property. Dishonest users can collude, change some of the marks and create a new copy. In this case codes with the 'identifiable parent property' or IPP codes [4], provide means of traceability. Here, both a new decoding algorithm for IPP codes and an improvement of earlier algorithms are presented.

This paper clarifies the relation between the learning curve and the algebraic geometrical structure of a non-identifiable learning machine such as a multilayer neural network whose true parameter set is an analytic set with singular points. By using a concept in algebraic analysis, we rigorously prove that the Bayesian stochastic complexity or the free energy is asymptotically equal to # 1 log n - (m 1 - 1) log log n+constant, where n is the number of training samples and # 1 and m 1 are the rational number and the natural number which are det...

This paper clarifies the relation between the learning curve and the algebraic geometrical structure of a non-identifiable learning machine such as a multilayer neural network whose true parameter set is an analytic set with singular points. By using a concept in algebraic analysis, we rigorously prove that the Bayesian stochastic complexity or the free energy is asymptotically equal to # 1 log n - (m 1 - 1) log log n+constant, where n is the number of training samples and # 1 and m 1 are the rational number and the natural number which are det...

Personally Identifiable Information (PII), as used in inform...

The identifiable victim effect refers to the tendency of ind...