Abstract: The invention relates to a hair treatment method for treating hair by using a hair treatment tool (1). The hair treatment tool (1) includes: a fiber structure member (5) that retains a hair cosmetic; and a liquid-impermeable sheet (3) to which the fiber structure member (5) is fixed. The fiber structure member (5) retains a hair cosmetic that includes a pigment and a film-forming resin, and is sealed in a packaging (2). The hair treatment method of the invention treats hair by: exposing a surface of the fiber structure member (5) of the hair treatment tool (1); and bringing the fiber structure member (5) into contact with hair, and in this state, moving the fiber structure member (5) in a direction of orientation of the hair.

Abstract: The invention relates to a hair treatment method for treating hair by using a hair treatment tool (1). The hair treatment tool (1) includes: a fiber structure member (5) that retains a hair cosmetic; and a liquid-impermeable sheet (3) to which the fiber structure member (5) is fixed. The fiber structure member (5) retains a hair cosmetic that includes a pigment and a film-forming resin, and is sealed in a packaging (2). The hair treatment method of the invention treats hair by: exposing a surface of the fiber structure member (5) of the hair treatment tool (1); and bringing the fiber structure member (5) into contact with hair, and in this state, moving the fiber structure member (5) in a direction of orientation of the hair.

Abstract: A technique in accordance with one embodiment of the invention automatically generates class interfaces for regular expressions based on graphs that correspond to the regular expressions. According to one embodiment of the invention, a graph is automatically generated based on a regular expression. Strongly connected components within the graph are automatically identified. For each strongly connected component within the graph, a separate method is generated within a class interface for the regular expression. In one embodiment of the invention, if a strongly connected component contains a cycle, then the method corresponding to that strongly connected component is generated to return a List of “T,” where “T” is a type that is as specific as the contents of the strongly typed component permit.

Abstract: A binding framework including a binder operable to associate and synchronize particular document objects with corresponding content objects performs unmarshalling to create the content objects from the XML documents. The content objects, which may in particular configurations be JAXB content objects, provide an alternate view to the XML data contained in the underlying XML documents. Java (i.e. user) applications then modify, or update the content objects via the alternate view, and rewrite, or update, the corresponding XML document during a marshalling process (i.e. writing the data from Java back into XML). The binding framework maintains the associations such that bound content objects are modifiable and may update the corresponding XML data in a non-destructive manner which avoids overwriting or “clobbering” other preexisting data contained in the XML document object during marshalling.

Abstract: System and method for providing a binary encoding protocol as an alternative to markup language protocols for Web services. Embodiments may provide a Web services stack with a single API that supports a binary encoding protocol in addition to a markup language protocol. Embodiments may dynamically and transparently switch between the markup language protocol and the binary encoding protocol, for example for communications between servers and clients in a Web services network environment. An exemplary markup language is XML. An exemplary binary encoding protocol that may be used is WS-Fast, which may use Abstract Syntax Notation One (ASN.1) and a mapping from XML Schema to ASN.1 for on-the-wire binary messages. Some embodiments may be implemented as a Java Web services stack that implements WS-Fast as an alternative to XML, while still supporting XML and providing one API to both protocols.

Abstract: System and method for proxying isomorphic interfaces in different subsystems. Embodiments may provide a proxy mechanism that may generate proxies for isomorphic interfaces at runtime. Embodiments may allow two mutually indifferent subsystems to communicate with each other in a straightforward, transparent manner via proxies, without requiring a common shared library or complex coding. Embodiments of the proxy mechanism transparently generate proxies for isomorphic interfaces between subsystems in a virtual machine. In one embodiment, the application developer registers the interfaces that require proxying. The proxy mechanism then generates proxy instances. Methods may then be invoked, and the proxies handle the details of converting and forwarding the calls in accordance with the appropriate interface.

Abstract: A technique in accordance with one embodiment of the invention automatically generates class interfaces for regular expressions based on graphs that correspond to the regular expressions. According to one embodiment of the invention, a graph is automatically generated based on a regular expression. Strongly connected components within the graph are automatically identified. For each strongly connected component within the graph, a separate method is generated within a class interface for the regular expression. In one embodiment of the invention, if a strongly connected component contains a cycle, then the method corresponding to that strongly connected component is generated to return a List of “T,” where “T” is a type that is as specific as the contents of the strongly typed component permit.